NO This is Ultimate 0.2.2-dev-e7f90c1-m [2023-02-13 03:40:30,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 03:40:30,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 03:40:30,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 03:40:30,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 03:40:30,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 03:40:30,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 03:40:30,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 03:40:30,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 03:40:30,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 03:40:30,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 03:40:30,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 03:40:30,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 03:40:30,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 03:40:30,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 03:40:30,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 03:40:30,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 03:40:30,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 03:40:30,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 03:40:30,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 03:40:30,827 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2023-02-13 03:40:30,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 03:40:30,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 03:40:30,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 03:40:30,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 03:40:30,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 03:40:30,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 03:40:30,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 03:40:30,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 03:40:30,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 03:40:30,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 03:40:30,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 03:40:30,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 03:40:30,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 03:40:30,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 03:40:30,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 03:40:30,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 03:40:30,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 03:40:30,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 03:40:30,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 03:40:30,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 03:40:30,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 03:40:30,835 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/Ultimate/./../termcomp2017.epf [2023-02-13 03:40:30,845 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 03:40:30,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 03:40:30,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 03:40:30,846 INFO L138 SettingsManager]: * Rewrite not-equals=true [2023-02-13 03:40:30,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 03:40:30,846 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 03:40:30,847 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:30,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 03:40:30,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2023-02-13 03:40:30,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:40:30,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 03:40:30,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/export/starexec/sandbox/solver/Ultimate/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-02-13 03:40:30,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 03:40:30,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 03:40:30,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 03:40:30,988 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 03:40:30,988 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 03:40:30,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:40:31,031 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8fa248611bb548398fbe40f8cc1cc0c1/FLAGa56836dfe [2023-02-13 03:40:31,368 INFO L306 CDTParser]: Found 1 translation units. [2023-02-13 03:40:31,368 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2023-02-13 03:40:31,371 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8fa248611bb548398fbe40f8cc1cc0c1/FLAGa56836dfe [2023-02-13 03:40:31,826 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8fa248611bb548398fbe40f8cc1cc0c1 [2023-02-13 03:40:31,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 03:40:31,831 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2023-02-13 03:40:31,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 03:40:31,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 03:40:31,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 03:40:31,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:31,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11adf0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31, skipping insertion in model container [2023-02-13 03:40:31,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:31,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 03:40:31,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 03:40:31,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:40:31,957 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 03:40:31,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 03:40:31,970 INFO L208 MainTranslator]: Completed translation [2023-02-13 03:40:31,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31 WrapperNode [2023-02-13 03:40:31,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 03:40:31,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 03:40:31,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 03:40:31,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 03:40:31,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:31,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:31,998 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-13 03:40:31,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 03:40:31,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 03:40:31,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 03:40:31,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 03:40:32,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 03:40:32,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 03:40:32,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 03:40:32,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 03:40:32,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (1/1) ... [2023-02-13 03:40:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2023-02-13 03:40:32,022 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,043 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Waiting until timeout for monitored process [2023-02-13 03:40:32,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 03:40:32,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 03:40:32,109 INFO L234 CfgBuilder]: Building ICFG [2023-02-13 03:40:32,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 03:40:32,188 INFO L275 CfgBuilder]: Performing block encoding [2023-02-13 03:40:32,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 03:40:32,194 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 03:40:32,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32 BoogieIcfgContainer [2023-02-13 03:40:32,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 03:40:32,197 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2023-02-13 03:40:32,197 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2023-02-13 03:40:32,198 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2023-02-13 03:40:32,199 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32" (1/1) ... [2023-02-13 03:40:32,207 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 14 edges [2023-02-13 03:40:32,208 INFO L258 BlockEncoder]: Using Remove infeasible edges [2023-02-13 03:40:32,208 INFO L263 BlockEncoder]: Using Maximize final states [2023-02-13 03:40:32,209 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2023-02-13 03:40:32,209 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2023-02-13 03:40:32,209 INFO L296 BlockEncoder]: Using Remove sink states [2023-02-13 03:40:32,210 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2023-02-13 03:40:32,210 INFO L179 BlockEncoder]: Using Rewrite not-equals [2023-02-13 03:40:32,223 INFO L185 BlockEncoder]: Using Use SBE [2023-02-13 03:40:32,231 INFO L200 BlockEncoder]: SBE split 1 edges [2023-02-13 03:40:32,234 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2023-02-13 03:40:32,235 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:40:32,238 INFO L101 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2023-02-13 03:40:32,239 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2023-02-13 03:40:32,240 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2023-02-13 03:40:32,240 INFO L71 MaximizeFinalStates]: 0 new accepting states [2023-02-13 03:40:32,240 INFO L101 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2023-02-13 03:40:32,240 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2023-02-13 03:40:32,241 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 8 edges [2023-02-13 03:40:32,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:40:32 BasicIcfg [2023-02-13 03:40:32,241 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2023-02-13 03:40:32,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 03:40:32,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 03:40:32,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 03:40:32,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 03:40:31" (1/4) ... [2023-02-13 03:40:32,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5285fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (2/4) ... [2023-02-13 03:40:32,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5285fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32" (3/4) ... [2023-02-13 03:40:32,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5285fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:40:32" (4/4) ... [2023-02-13 03:40:32,246 INFO L111 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:40:32,255 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-02-13 03:40:32,255 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 0 error locations. [2023-02-13 03:40:32,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5285fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 03:40:32,256 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-13 03:40:32,256 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-13 03:40:32,258 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-13 03:40:32,258 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.02 03:40:31" (1/4) ... [2023-02-13 03:40:32,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47cf5a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 03:40:31" (2/4) ... [2023-02-13 03:40:32,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47cf5a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 03:40:32" (3/4) ... [2023-02-13 03:40:32,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47cf5a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:40:32, skipping insertion in model container [2023-02-13 03:40:32,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-13 03:40:32,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 13.02 03:40:32" (4/4) ... [2023-02-13 03:40:32,260 INFO L322 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2023-02-13 03:40:32,291 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2023-02-13 03:40:32,291 INFO L302 stractBuchiCegarLoop]: Hoare is true [2023-02-13 03:40:32,291 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-13 03:40:32,291 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-13 03:40:32,291 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-13 03:40:32,291 INFO L306 stractBuchiCegarLoop]: Difference is false [2023-02-13 03:40:32,291 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-13 03:40:32,292 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-13 03:40:32,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:40:32,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:32,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:32,307 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:40:32,307 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:32,307 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-13 03:40:32,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-13 03:40:32,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:32,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:32,308 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:40:32,308 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:32,311 INFO L733 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 4#L18-1true [2023-02-13 03:40:32,311 INFO L735 eck$LassoCheckResult]: Loop: 4#L18-1true [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 6#L12true [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 2#L12-2true [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 5#L15-1true [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 4#L18-1true [2023-02-13 03:40:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 1 times [2023-02-13 03:40:32,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,320 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948712705] [2023-02-13 03:40:32,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2222072, now seen corresponding path program 1 times [2023-02-13 03:40:32,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,375 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235707725] [2023-02-13 03:40:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:32,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:32,414 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235707725] [2023-02-13 03:40:32,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235707725] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:32,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:32,415 ERROR L191 FreeRefinementEngine]: {11#true} [11#true, 13#(<= 10 |ULTIMATE.start_main_~i~0#1|), 12#false] {12#false} [2023-02-13 03:40:32,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 03:40:32,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443175041] [2023-02-13 03:40:32,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:32,419 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:32,439 INFO L87 Difference]: Start difference. First operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:32,463 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2023-02-13 03:40:32,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 13 transitions. [2023-02-13 03:40:32,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-13 03:40:32,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 13 transitions. [2023-02-13 03:40:32,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-02-13 03:40:32,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-02-13 03:40:32,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2023-02-13 03:40:32,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-13 03:40:32,469 INFO L220 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2023-02-13 03:40:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2023-02-13 03:40:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-13 03:40:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2023-02-13 03:40:32,486 INFO L242 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2023-02-13 03:40:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:32,491 INFO L426 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2023-02-13 03:40:32,491 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-13 03:40:32,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2023-02-13 03:40:32,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-13 03:40:32,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:32,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:32,492 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2023-02-13 03:40:32,492 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:32,492 INFO L733 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 25#L18-1 [2023-02-13 03:40:32,492 INFO L735 eck$LassoCheckResult]: Loop: 25#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 26#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 23#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 24#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 25#L18-1 [2023-02-13 03:40:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash 88, now seen corresponding path program 2 times [2023-02-13 03:40:32,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,493 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197902970] [2023-02-13 03:40:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2222568, now seen corresponding path program 1 times [2023-02-13 03:40:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,498 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257142201] [2023-02-13 03:40:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash 82568895, now seen corresponding path program 1 times [2023-02-13 03:40:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:32,506 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580452231] [2023-02-13 03:40:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:32,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:32,550 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:32,550 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:32,550 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:32,550 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:32,550 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:32,550 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:32,550 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:32,550 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:32,551 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2023-02-13 03:40:32,551 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:32,551 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:32,558 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,565 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,567 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,570 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,599 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:32,599 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,605 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-13 03:40:32,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:32,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:32,623 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:32,623 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:32,639 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:32,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:32,640 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,641 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-13 03:40:32,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:32,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:32,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:32,651 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:32,667 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-13 03:40:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,670 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-13 03:40:32,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:32,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:32,681 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:32,681 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:32,701 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-13 03:40:32,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,707 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-13 03:40:32,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:32,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:32,739 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-13 03:40:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,749 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-13 03:40:32,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:32,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:32,768 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:32,790 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-13 03:40:32,790 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:32,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:32,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:32,790 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:32,790 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:32,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:32,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:32,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:32,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2023-02-13 03:40:32,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:32,791 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:32,792 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,795 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,798 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,800 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:32,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:32,826 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:32,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:32,827 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,829 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-13 03:40:32,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:32,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:32,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:32,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:32,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:32,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:32,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:32,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:32,864 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-13 03:40:32,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:32,864 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,865 INFO L229 MonitoredProcess]: Starting monitored process 8 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,866 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-13 03:40:32,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:32,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:32,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:32,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:32,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:32,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:32,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:32,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:32,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:32,877 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-13 03:40:32,877 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:32,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:32,882 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-13 03:40:32,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:32,883 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:32,883 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:32,885 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-13 03:40:32,905 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-13 03:40:32,911 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:32,942 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:32,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:32,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:32,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:32,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:32,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:32,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:32,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,012 INFO L100 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2023-02-13 03:40:33,013 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-13 03:40:33,014 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,048 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 50 transitions. Complement of second has 10 states. [2023-02-13 03:40:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2023-02-13 03:40:33,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 1 letters. Loop has 4 letters. [2023-02-13 03:40:33,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-13 03:40:33,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 1 letters. Loop has 8 letters. [2023-02-13 03:40:33,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-02-13 03:40:33,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2023-02-13 03:40:33,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 44 transitions. [2023-02-13 03:40:33,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-02-13 03:40:33,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-02-13 03:40:33,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 44 transitions. [2023-02-13 03:40:33,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,054 INFO L220 hiAutomatonCegarLoop]: Abstraction has 29 states and 44 transitions. [2023-02-13 03:40:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 44 transitions. [2023-02-13 03:40:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2023-02-13 03:40:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2023-02-13 03:40:33,056 INFO L242 hiAutomatonCegarLoop]: Abstraction has 23 states and 36 transitions. [2023-02-13 03:40:33,056 INFO L426 stractBuchiCegarLoop]: Abstraction has 23 states and 36 transitions. [2023-02-13 03:40:33,056 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-13 03:40:33,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 36 transitions. [2023-02-13 03:40:33,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-13 03:40:33,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,057 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:33,057 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:33,057 INFO L733 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 139#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 145#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 152#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 140#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 134#L18-1 [2023-02-13 03:40:33,057 INFO L735 eck$LassoCheckResult]: Loop: 134#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 135#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 142#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 147#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 134#L18-1 [2023-02-13 03:40:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 82568885, now seen corresponding path program 1 times [2023-02-13 03:40:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,058 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193777494] [2023-02-13 03:40:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,067 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193777494] [2023-02-13 03:40:33,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193777494] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,068 ERROR L191 FreeRefinementEngine]: {154#true} [154#true, 154#true, 156#(<= |ULTIMATE.start_main_~up~0#1| 0), 156#(<= |ULTIMATE.start_main_~up~0#1| 0)] {155#false} [2023-02-13 03:40:33,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160128726] [2023-02-13 03:40:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,068 INFO L738 eck$LassoCheckResult]: stem already infeasible [2023-02-13 03:40:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2222558, now seen corresponding path program 1 times [2023-02-13 03:40:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,069 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269061380] [2023-02-13 03:40:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,076 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269061380] [2023-02-13 03:40:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269061380] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,077 ERROR L191 FreeRefinementEngine]: {157#true} [157#true, 159#(<= |ULTIMATE.start_main_~up~0#1| 0), 159#(<= |ULTIMATE.start_main_~up~0#1| 0)] {158#false} [2023-02-13 03:40:33,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 03:40:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565505573] [2023-02-13 03:40:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,077 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:33,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:33,078 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. cyclomatic complexity: 15 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:33,084 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2023-02-13 03:40:33,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 39 transitions. [2023-02-13 03:40:33,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-02-13 03:40:33,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 35 transitions. [2023-02-13 03:40:33,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-02-13 03:40:33,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-02-13 03:40:33,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2023-02-13 03:40:33,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,085 INFO L220 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-02-13 03:40:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2023-02-13 03:40:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-02-13 03:40:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2023-02-13 03:40:33,088 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 33 transitions. [2023-02-13 03:40:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:33,088 INFO L426 stractBuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2023-02-13 03:40:33,088 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-13 03:40:33,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. [2023-02-13 03:40:33,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2023-02-13 03:40:33,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,089 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:33,089 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:33,090 INFO L733 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 192#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 204#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 207#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 197#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 198#L18-1 [2023-02-13 03:40:33,090 INFO L735 eck$LassoCheckResult]: Loop: 198#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 208#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 206#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 205#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 198#L18-1 [2023-02-13 03:40:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash 82572233, now seen corresponding path program 1 times [2023-02-13 03:40:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,090 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047633085] [2023-02-13 03:40:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2225906, now seen corresponding path program 1 times [2023-02-13 03:40:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,097 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775686863] [2023-02-13 03:40:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 48154298, now seen corresponding path program 2 times [2023-02-13 03:40:33,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,103 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337891163] [2023-02-13 03:40:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,115 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337891163] [2023-02-13 03:40:33,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337891163] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,116 ERROR L191 FreeRefinementEngine]: {214#true} [214#true, 216#(<= 0 |ULTIMATE.start_main_~i~0#1|), 216#(<= 0 |ULTIMATE.start_main_~i~0#1|), 216#(<= 0 |ULTIMATE.start_main_~i~0#1|), 217#(<= 1 |ULTIMATE.start_main_~i~0#1|), 217#(<= 1 |ULTIMATE.start_main_~i~0#1|), 217#(<= 1 |ULTIMATE.start_main_~i~0#1|), 215#false] {215#false} [2023-02-13 03:40:33,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 03:40:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470147465] [2023-02-13 03:40:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,131 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,131 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:33,131 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,131 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,131 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2023-02-13 03:40:33,132 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,132 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,136 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,138 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,160 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,160 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:33,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,161 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,161 INFO L229 MonitoredProcess]: Starting monitored process 10 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,166 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-13 03:40:33,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,175 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,191 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-02-13 03:40:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,194 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-13 03:40:33,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,230 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-02-13 03:40:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,235 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-13 03:40:33,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:33,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,246 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:33,269 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-02-13 03:40:33,270 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,270 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:33,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2023-02-13 03:40:33,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,274 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,278 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,303 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,308 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-13 03:40:33,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:33,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:33,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:33,332 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-02-13 03:40:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,333 INFO L229 MonitoredProcess]: Starting monitored process 14 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,335 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-13 03:40:33,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:33,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:33,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:33,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:33,351 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:33,352 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:33,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,352 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,353 INFO L229 MonitoredProcess]: Starting monitored process 15 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:33,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:33,360 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:33,360 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2023-02-13 03:40:33,361 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-13 03:40:33,374 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:33,375 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,457 INFO L100 LoopCannibalizer]: 2 predicates before loop cannibalization 4 predicates after loop cannibalization [2023-02-13 03:40:33,457 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-13 03:40:33,457 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 33 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,511 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 33 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 176 transitions. Complement of second has 32 states. [2023-02-13 03:40:33,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2023-02-13 03:40:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2023-02-13 03:40:33,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-13 03:40:33,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-13 03:40:33,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-13 03:40:33,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:33,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 176 transitions. [2023-02-13 03:40:33,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2023-02-13 03:40:33,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 61 states and 86 transitions. [2023-02-13 03:40:33,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-13 03:40:33,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-02-13 03:40:33,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 86 transitions. [2023-02-13 03:40:33,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,519 INFO L220 hiAutomatonCegarLoop]: Abstraction has 61 states and 86 transitions. [2023-02-13 03:40:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 86 transitions. [2023-02-13 03:40:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2023-02-13 03:40:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2023-02-13 03:40:33,523 INFO L242 hiAutomatonCegarLoop]: Abstraction has 49 states and 72 transitions. [2023-02-13 03:40:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 03:40:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 03:40:33,524 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:33,536 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2023-02-13 03:40:33,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 73 transitions. [2023-02-13 03:40:33,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2023-02-13 03:40:33,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 73 transitions. [2023-02-13 03:40:33,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-02-13 03:40:33,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-02-13 03:40:33,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 73 transitions. [2023-02-13 03:40:33,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,539 INFO L220 hiAutomatonCegarLoop]: Abstraction has 53 states and 73 transitions. [2023-02-13 03:40:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 73 transitions. [2023-02-13 03:40:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2023-02-13 03:40:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2023-02-13 03:40:33,542 INFO L242 hiAutomatonCegarLoop]: Abstraction has 48 states and 68 transitions. [2023-02-13 03:40:33,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 03:40:33,543 INFO L426 stractBuchiCegarLoop]: Abstraction has 48 states and 68 transitions. [2023-02-13 03:40:33,543 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-13 03:40:33,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 68 transitions. [2023-02-13 03:40:33,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2023-02-13 03:40:33,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,545 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:33,545 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2023-02-13 03:40:33,545 INFO L733 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 551#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 564#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 565#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 560#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 559#L18-1 [2023-02-13 03:40:33,545 INFO L735 eck$LassoCheckResult]: Loop: 559#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 556#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 557#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 563#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 570#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 571#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 561#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 562#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 559#L18-1 [2023-02-13 03:40:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash 82572233, now seen corresponding path program 3 times [2023-02-13 03:40:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,546 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47368092] [2023-02-13 03:40:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,551 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash -404843175, now seen corresponding path program 1 times [2023-02-13 03:40:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,555 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128538243] [2023-02-13 03:40:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,566 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128538243] [2023-02-13 03:40:33,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128538243] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:40:33,566 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744861263] [2023-02-13 03:40:33,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:40:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,570 INFO L229 MonitoredProcess]: Starting monitored process 16 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,574 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-13 03:40:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:40:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:33,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744861263] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:40:33,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:40:33,602 ERROR L197 FreeRefinementEngine]: {592#true} [592#true, 594#(<= 10 |ULTIMATE.start_main_~i~0#1|), 594#(<= 10 |ULTIMATE.start_main_~i~0#1|), 595#(<= 9 |ULTIMATE.start_main_~i~0#1|), 595#(<= 9 |ULTIMATE.start_main_~i~0#1|), 595#(<= 9 |ULTIMATE.start_main_~i~0#1|), 593#false] {593#false} [2023-02-13 03:40:33,603 ERROR L197 FreeRefinementEngine]: {592#true} [592#true, 594#(<= 10 |ULTIMATE.start_main_~i~0#1|), 594#(<= 10 |ULTIMATE.start_main_~i~0#1|), 595#(<= 9 |ULTIMATE.start_main_~i~0#1|), 595#(<= 9 |ULTIMATE.start_main_~i~0#1|), 595#(<= 9 |ULTIMATE.start_main_~i~0#1|), 593#false] {593#false} [2023-02-13 03:40:33,603 ERROR L197 FreeRefinementEngine]: {592#true} [592#true, 633#(< 1 |ULTIMATE.start_main_~i~0#1|), 633#(< 1 |ULTIMATE.start_main_~i~0#1|), 623#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 623#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 623#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 593#false] {593#false} [2023-02-13 03:40:33,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-13 03:40:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273895310] [2023-02-13 03:40:33,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,603 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 03:40:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-13 03:40:33,604 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. cyclomatic complexity: 23 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:33,617 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2023-02-13 03:40:33,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 101 transitions. [2023-02-13 03:40:33,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2023-02-13 03:40:33,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 58 states and 78 transitions. [2023-02-13 03:40:33,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-13 03:40:33,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-02-13 03:40:33,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2023-02-13 03:40:33,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:33,619 INFO L220 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2023-02-13 03:40:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2023-02-13 03:40:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2023-02-13 03:40:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2023-02-13 03:40:33,628 INFO L242 hiAutomatonCegarLoop]: Abstraction has 49 states and 67 transitions. [2023-02-13 03:40:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 03:40:33,629 INFO L426 stractBuchiCegarLoop]: Abstraction has 49 states and 67 transitions. [2023-02-13 03:40:33,629 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-13 03:40:33,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 67 transitions. [2023-02-13 03:40:33,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-13 03:40:33,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:33,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:33,630 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-13 03:40:33,630 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2023-02-13 03:40:33,631 INFO L733 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 725#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 736#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 756#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 730#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 731#L18-1 [2023-02-13 03:40:33,631 INFO L735 eck$LassoCheckResult]: Loop: 731#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 762#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 754#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 755#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 758#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 757#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 751#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 752#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 731#L18-1 [2023-02-13 03:40:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 82572233, now seen corresponding path program 4 times [2023-02-13 03:40:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,632 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022278281] [2023-02-13 03:40:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1149795747, now seen corresponding path program 1 times [2023-02-13 03:40:33,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,638 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781753630] [2023-02-13 03:40:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:33,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1882664485, now seen corresponding path program 1 times [2023-02-13 03:40:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:33,645 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389313534] [2023-02-13 03:40:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:33,648 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-02-13 03:40:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 03:40:33,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:33,658 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389313534] [2023-02-13 03:40:33,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389313534] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:33,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:33,658 ERROR L191 FreeRefinementEngine]: {774#true} [774#true, 774#true, 774#true, 776#(<= 1 |ULTIMATE.start_main_~up~0#1|), 776#(<= 1 |ULTIMATE.start_main_~up~0#1|), 776#(<= 1 |ULTIMATE.start_main_~up~0#1|), 776#(<= 1 |ULTIMATE.start_main_~up~0#1|), 776#(<= 1 |ULTIMATE.start_main_~up~0#1|), 775#false, 775#false, 775#false, 775#false] {775#false} [2023-02-13 03:40:33,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 03:40:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392293401] [2023-02-13 03:40:33,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:33,662 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-13 03:40:33,679 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,679 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,679 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,679 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,679 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:33,679 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,679 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,679 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,679 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2023-02-13 03:40:33,679 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,679 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,680 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,686 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,687 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,703 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,703 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:33,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,704 INFO L229 MonitoredProcess]: Starting monitored process 17 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,705 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-13 03:40:33,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,710 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:33,710 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=1} Honda state: {ULTIMATE.start_main_~i~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:33,724 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-13 03:40:33,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,725 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,726 INFO L229 MonitoredProcess]: Starting monitored process 18 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,727 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-13 03:40:33,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:33,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,746 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-02-13 03:40:33,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:33,747 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,748 INFO L229 MonitoredProcess]: Starting monitored process 19 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,750 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-13 03:40:33,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:33,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:33,774 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:33,775 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-02-13 03:40:33,776 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:33,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:33,776 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:33,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:33,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:33,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:33,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:33,778 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2023-02-13 03:40:33,778 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:33,778 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:33,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,793 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,803 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:33,845 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:33,845 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,847 INFO L229 MonitoredProcess]: Starting monitored process 20 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,851 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-13 03:40:33,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:33,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:33,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:33,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:33,891 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:33,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,893 INFO L229 MonitoredProcess]: Starting monitored process 21 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,895 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-13 03:40:33,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:33,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:33,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:33,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:33,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:33,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:33,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:33,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:33,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:33,914 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:33,914 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:33,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:33,917 INFO L229 MonitoredProcess]: Starting monitored process 22 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:33,918 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-13 03:40:33,918 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:33,919 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:33,919 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:33,919 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~up~0#1) = -2*ULTIMATE.start_main_~up~0#1 + 1 Supporting invariants [] [2023-02-13 03:40:33,955 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-02-13 03:40:33,957 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:33,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:33,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,086 INFO L100 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2023-02-13 03:40:34,086 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-13 03:40:34,087 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 67 transitions. cyclomatic complexity: 20 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,163 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 67 transitions. cyclomatic complexity: 20. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 203 states and 269 transitions. Complement of second has 40 states. [2023-02-13 03:40:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2023-02-13 03:40:34,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-13 03:40:34,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 13 letters. Loop has 8 letters. [2023-02-13 03:40:34,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 5 letters. Loop has 16 letters. [2023-02-13 03:40:34,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 269 transitions. [2023-02-13 03:40:34,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2023-02-13 03:40:34,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 57 states and 74 transitions. [2023-02-13 03:40:34,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-13 03:40:34,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-02-13 03:40:34,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2023-02-13 03:40:34,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,174 INFO L220 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2023-02-13 03:40:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2023-02-13 03:40:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2023-02-13 03:40:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-02-13 03:40:34,177 INFO L242 hiAutomatonCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-02-13 03:40:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:34,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 03:40:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 03:40:34,178 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:34,185 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2023-02-13 03:40:34,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2023-02-13 03:40:34,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2023-02-13 03:40:34,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 56 transitions. [2023-02-13 03:40:34,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-02-13 03:40:34,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-13 03:40:34,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2023-02-13 03:40:34,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,186 INFO L220 hiAutomatonCegarLoop]: Abstraction has 43 states and 56 transitions. [2023-02-13 03:40:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2023-02-13 03:40:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-02-13 03:40:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2023-02-13 03:40:34,188 INFO L242 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2023-02-13 03:40:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 03:40:34,189 INFO L426 stractBuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2023-02-13 03:40:34,189 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-13 03:40:34,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2023-02-13 03:40:34,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2023-02-13 03:40:34,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,190 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:40:34,190 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-13 03:40:34,190 INFO L733 eck$LassoCheckResult]: Stem: 1206#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1207#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1217#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1202#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1203#L15-1 [2023-02-13 03:40:34,190 INFO L735 eck$LassoCheckResult]: Loop: 1203#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1208#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1209#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1215#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1203#L15-1 [2023-02-13 03:40:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2663619, now seen corresponding path program 1 times [2023-02-13 03:40:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,191 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488991205] [2023-02-13 03:40:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2276352, now seen corresponding path program 1 times [2023-02-13 03:40:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,198 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255431506] [2023-02-13 03:40:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1106825278, now seen corresponding path program 1 times [2023-02-13 03:40:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,203 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734932020] [2023-02-13 03:40:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,221 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:34,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:34,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:34,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:34,222 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:34,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:34,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:34,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2023-02-13 03:40:34,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:34,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:34,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,227 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,244 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:34,244 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:34,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,244 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,244 INFO L229 MonitoredProcess]: Starting monitored process 23 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,245 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-13 03:40:34,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:34,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,264 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-13 03:40:34,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,265 INFO L229 MonitoredProcess]: Starting monitored process 24 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,266 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-13 03:40:34,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:34,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,333 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:34,334 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-13 03:40:34,335 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:34,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:34,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:34,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:34,335 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:34,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:34,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:34,335 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2023-02-13 03:40:34,335 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:34,335 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:34,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:34,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:34,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,384 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,384 INFO L229 MonitoredProcess]: Starting monitored process 25 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,386 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-13 03:40:34,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:34,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:34,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:34,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:34,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:34,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:34,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:34,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:34,396 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:34,398 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:34,398 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-13 03:40:34,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,399 INFO L229 MonitoredProcess]: Starting monitored process 26 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,400 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-13 03:40:34,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:34,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:34,402 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:34,402 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 17 Supporting invariants [] [2023-02-13 03:40:34,419 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-02-13 03:40:34,420 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,469 INFO L139 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2023-02-13 03:40:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,485 INFO L100 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2023-02-13 03:40:34,485 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-13 03:40:34,485 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states and 53 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,582 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states and 53 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 151 states and 185 transitions. Complement of second has 24 states. [2023-02-13 03:40:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2023-02-13 03:40:34,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 4 letters. Loop has 4 letters. [2023-02-13 03:40:34,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-13 03:40:34,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 4 letters. Loop has 8 letters. [2023-02-13 03:40:34,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:34,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 185 transitions. [2023-02-13 03:40:34,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2023-02-13 03:40:34,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 66 states and 82 transitions. [2023-02-13 03:40:34,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2023-02-13 03:40:34,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2023-02-13 03:40:34,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 82 transitions. [2023-02-13 03:40:34,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,588 INFO L220 hiAutomatonCegarLoop]: Abstraction has 66 states and 82 transitions. [2023-02-13 03:40:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 82 transitions. [2023-02-13 03:40:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-02-13 03:40:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 61 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-02-13 03:40:34,590 INFO L242 hiAutomatonCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-02-13 03:40:34,590 INFO L426 stractBuchiCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-02-13 03:40:34,590 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-13 03:40:34,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 77 transitions. [2023-02-13 03:40:34,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2023-02-13 03:40:34,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,591 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:40:34,591 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2023-02-13 03:40:34,591 INFO L733 eck$LassoCheckResult]: Stem: 1477#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1478#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1500#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1491#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1489#L15-1 [2023-02-13 03:40:34,592 INFO L735 eck$LassoCheckResult]: Loop: 1489#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1490#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1485#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1486#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1532#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1531#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1530#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1529#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1527#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1525#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1515#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1514#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1513#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1512#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1511#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1510#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1509#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1508#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1492#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1493#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1489#L15-1 [2023-02-13 03:40:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2663619, now seen corresponding path program 2 times [2023-02-13 03:40:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,592 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138526957] [2023-02-13 03:40:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash 250488136, now seen corresponding path program 2 times [2023-02-13 03:40:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,597 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172471996] [2023-02-13 03:40:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,622 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172471996] [2023-02-13 03:40:34,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172471996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:40:34,622 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631463083] [2023-02-13 03:40:34,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 03:40:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:40:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,622 INFO L229 MonitoredProcess]: Starting monitored process 27 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,629 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-13 03:40:34,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 03:40:34,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:40:34,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:34,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:40:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 03:40:34,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631463083] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:40:34,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:40:34,692 ERROR L197 FreeRefinementEngine]: {1538#true} [1538#true, 1538#true, 1540#(<= 10 |ULTIMATE.start_main_~i~0#1|), 1540#(<= 10 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1544#(<= 6 |ULTIMATE.start_main_~i~0#1|), 1544#(<= 6 |ULTIMATE.start_main_~i~0#1|), 1544#(<= 6 |ULTIMATE.start_main_~i~0#1|)] {1539#false} [2023-02-13 03:40:34,692 ERROR L197 FreeRefinementEngine]: {1538#true} [1538#true, 1538#true, 1540#(<= 10 |ULTIMATE.start_main_~i~0#1|), 1540#(<= 10 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1541#(<= 9 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1542#(<= 8 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1543#(<= 7 |ULTIMATE.start_main_~i~0#1|), 1544#(<= 6 |ULTIMATE.start_main_~i~0#1|), 1544#(<= 6 |ULTIMATE.start_main_~i~0#1|), 1544#(<= 6 |ULTIMATE.start_main_~i~0#1|)] {1539#false} [2023-02-13 03:40:34,692 ERROR L197 FreeRefinementEngine]: {1538#true} [1538#true, 1538#true, 1654#(< 4 |ULTIMATE.start_main_~i~0#1|), 1654#(< 4 |ULTIMATE.start_main_~i~0#1|), 1641#(< 3 |ULTIMATE.start_main_~i~0#1|), 1641#(< 3 |ULTIMATE.start_main_~i~0#1|), 1641#(< 3 |ULTIMATE.start_main_~i~0#1|), 1641#(< 3 |ULTIMATE.start_main_~i~0#1|), 1628#(< 2 |ULTIMATE.start_main_~i~0#1|), 1628#(< 2 |ULTIMATE.start_main_~i~0#1|), 1628#(< 2 |ULTIMATE.start_main_~i~0#1|), 1628#(< 2 |ULTIMATE.start_main_~i~0#1|), 1615#(< 1 |ULTIMATE.start_main_~i~0#1|), 1615#(< 1 |ULTIMATE.start_main_~i~0#1|), 1615#(< 1 |ULTIMATE.start_main_~i~0#1|), 1615#(< 1 |ULTIMATE.start_main_~i~0#1|), 1605#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 1605#(not (<= |ULTIMATE.start_main_~i~0#1| 0)), 1605#(not (<= |ULTIMATE.start_main_~i~0#1| 0))] {1539#false} [2023-02-13 03:40:34,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-13 03:40:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008005014] [2023-02-13 03:40:34,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,693 INFO L750 eck$LassoCheckResult]: loop already infeasible [2023-02-13 03:40:34,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:34,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-13 03:40:34,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-13 03:40:34,693 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. cyclomatic complexity: 17 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:34,741 INFO L93 Difference]: Finished difference Result 202 states and 237 transitions. [2023-02-13 03:40:34,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 237 transitions. [2023-02-13 03:40:34,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 147 [2023-02-13 03:40:34,742 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-13 03:40:34,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 193 states and 228 transitions. [2023-02-13 03:40:34,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2023-02-13 03:40:34,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2023-02-13 03:40:34,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 228 transitions. [2023-02-13 03:40:34,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:34,744 INFO L220 hiAutomatonCegarLoop]: Abstraction has 193 states and 228 transitions. [2023-02-13 03:40:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 228 transitions. [2023-02-13 03:40:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2023-02-13 03:40:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.206060606060606) internal successors, (199), 164 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2023-02-13 03:40:34,748 INFO L242 hiAutomatonCegarLoop]: Abstraction has 165 states and 199 transitions. [2023-02-13 03:40:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-13 03:40:34,749 INFO L426 stractBuchiCegarLoop]: Abstraction has 165 states and 199 transitions. [2023-02-13 03:40:34,749 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-13 03:40:34,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 199 transitions. [2023-02-13 03:40:34,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2023-02-13 03:40:34,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:34,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:34,750 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:40:34,750 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 10, 1, 1, 1] [2023-02-13 03:40:34,750 INFO L733 eck$LassoCheckResult]: Stem: 1870#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 1871#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1884#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1890#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1924#L15-1 [2023-02-13 03:40:34,751 INFO L735 eck$LassoCheckResult]: Loop: 1924#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1922#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1885#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1886#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1974#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1972#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1887#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1866#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1867#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 2001#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 2000#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1999#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1998#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1997#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1996#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1995#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1994#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1993#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1992#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1991#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1990#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1989#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1988#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1987#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1986#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1985#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1984#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1983#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1982#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1981#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1980#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1979#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1978#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1977#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1976#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1975#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1973#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1971#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1970#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1969#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 1968#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 1967#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 1925#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 1926#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 1924#L15-1 [2023-02-13 03:40:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2663619, now seen corresponding path program 3 times [2023-02-13 03:40:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,751 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072235469] [2023-02-13 03:40:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1961146630, now seen corresponding path program 3 times [2023-02-13 03:40:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,755 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079888607] [2023-02-13 03:40:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,757 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-13 03:40:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:34,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:34,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 58376904, now seen corresponding path program 1 times [2023-02-13 03:40:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:34,771 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713492165] [2023-02-13 03:40:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:34,783 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713492165] [2023-02-13 03:40:34,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713492165] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 03:40:34,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 03:40:34,783 ERROR L191 FreeRefinementEngine]: {2036#true} [2036#true, 2036#true, 2036#true, 2038#(<= |ULTIMATE.start_main_~i~0#1| 0), 2039#(<= |ULTIMATE.start_main_~i~0#1| 1), 2039#(<= |ULTIMATE.start_main_~i~0#1| 1), 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false, 2037#false] {2037#false} [2023-02-13 03:40:34,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 03:40:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965423673] [2023-02-13 03:40:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 03:40:34,899 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:34,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:34,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:34,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:34,899 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:34,899 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:34,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:34,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2023-02-13 03:40:34,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:34,900 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:34,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,909 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,910 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:34,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:34,936 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:34,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,936 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,937 INFO L229 MonitoredProcess]: Starting monitored process 28 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,937 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-13 03:40:34,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:34,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,962 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-02-13 03:40:34,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:34,963 INFO L229 MonitoredProcess]: Starting monitored process 29 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:34,964 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-13 03:40:34,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:34,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:34,977 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:34,995 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-02-13 03:40:34,995 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:34,995 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:34,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:34,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:34,995 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:34,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:34,995 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:34,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:34,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Loop [2023-02-13 03:40:34,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:34,996 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:34,996 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,000 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,002 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,005 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:35,033 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:35,033 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:35,034 INFO L229 MonitoredProcess]: Starting monitored process 30 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:35,035 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-13 03:40:35,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:35,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:35,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:35,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:35,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:35,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:35,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:35,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:35,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:35,051 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:35,051 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:40:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:35,052 INFO L229 MonitoredProcess]: Starting monitored process 31 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:35,054 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-13 03:40:35,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:35,055 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:35,055 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:35,055 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-13 03:40:35,084 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-02-13 03:40:35,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:35,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:35,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,075 INFO L100 LoopCannibalizer]: 3 predicates before loop cannibalization 8 predicates after loop cannibalization [2023-02-13 03:40:36,076 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2023-02-13 03:40:36,076 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 165 states and 199 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:36,174 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 165 states and 199 transitions. cyclomatic complexity: 36. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 680 states and 799 transitions. Complement of second has 24 states. [2023-02-13 03:40:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2023-02-13 03:40:36,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 4 letters. Loop has 44 letters. [2023-02-13 03:40:36,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:36,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 48 letters. Loop has 44 letters. [2023-02-13 03:40:36,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:36,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 4 letters. Loop has 88 letters. [2023-02-13 03:40:36,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:36,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 799 transitions. [2023-02-13 03:40:36,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2023-02-13 03:40:36,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 172 states and 206 transitions. [2023-02-13 03:40:36,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2023-02-13 03:40:36,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2023-02-13 03:40:36,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 206 transitions. [2023-02-13 03:40:36,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:36,191 INFO L220 hiAutomatonCegarLoop]: Abstraction has 172 states and 206 transitions. [2023-02-13 03:40:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 206 transitions. [2023-02-13 03:40:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2023-02-13 03:40:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.2) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2023-02-13 03:40:36,196 INFO L242 hiAutomatonCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-02-13 03:40:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 03:40:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 03:40:36,197 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:36,209 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2023-02-13 03:40:36,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 199 transitions. [2023-02-13 03:40:36,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2023-02-13 03:40:36,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 199 transitions. [2023-02-13 03:40:36,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-02-13 03:40:36,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-02-13 03:40:36,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 199 transitions. [2023-02-13 03:40:36,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:36,210 INFO L220 hiAutomatonCegarLoop]: Abstraction has 166 states and 199 transitions. [2023-02-13 03:40:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 199 transitions. [2023-02-13 03:40:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2023-02-13 03:40:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.2) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2023-02-13 03:40:36,213 INFO L242 hiAutomatonCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-02-13 03:40:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 03:40:36,214 INFO L426 stractBuchiCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-02-13 03:40:36,214 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-13 03:40:36,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 198 transitions. [2023-02-13 03:40:36,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2023-02-13 03:40:36,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:36,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:36,215 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:40:36,215 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2023-02-13 03:40:36,215 INFO L733 eck$LassoCheckResult]: Stem: 8661#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 8662#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8672#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8678#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 8667#L15-1 [2023-02-13 03:40:36,216 INFO L735 eck$LassoCheckResult]: Loop: 8667#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8663#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8664#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8791#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8658#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8778#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8763#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 8764#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8784#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8783#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8782#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8781#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8761#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8762#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8757#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8758#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8773#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8771#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8751#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8752#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8747#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8748#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8743#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8744#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8790#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8789#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8738#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8737#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8736#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8735#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8733#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8734#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8777#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8776#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8728#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8727#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8726#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8725#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8723#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8724#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8788#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8787#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8717#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8718#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 8780#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 8779#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 8712#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 8713#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 8667#L15-1 [2023-02-13 03:40:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2663619, now seen corresponding path program 4 times [2023-02-13 03:40:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:36,216 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343331950] [2023-02-13 03:40:36,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:36,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:36,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1103318395, now seen corresponding path program 4 times [2023-02-13 03:40:36,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:36,220 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467136628] [2023-02-13 03:40:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:36,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:36,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:36,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:36,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1688990905, now seen corresponding path program 2 times [2023-02-13 03:40:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:36,232 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663767023] [2023-02-13 03:40:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:36,247 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663767023] [2023-02-13 03:40:36,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663767023] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:40:36,247 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308824107] [2023-02-13 03:40:36,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 03:40:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:40:36,247 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,248 INFO L229 MonitoredProcess]: Starting monitored process 32 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,249 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-13 03:40:36,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 03:40:36,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:40:36,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:36,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:36,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:40:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:36,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308824107] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:40:36,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:40:36,295 ERROR L197 FreeRefinementEngine]: {8827#true} [8827#true, 8827#true, 8827#true, 8829#(<= |ULTIMATE.start_main_~i~0#1| 0), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8831#(<= |ULTIMATE.start_main_~i~0#1| 2), 8831#(<= |ULTIMATE.start_main_~i~0#1| 2), 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false] {8828#false} [2023-02-13 03:40:36,296 ERROR L197 FreeRefinementEngine]: {8827#true} [8827#true, 8827#true, 8827#true, 8829#(<= |ULTIMATE.start_main_~i~0#1| 0), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8830#(<= |ULTIMATE.start_main_~i~0#1| 1), 8831#(<= |ULTIMATE.start_main_~i~0#1| 2), 8831#(<= |ULTIMATE.start_main_~i~0#1| 2), 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false] {8828#false} [2023-02-13 03:40:36,296 ERROR L197 FreeRefinementEngine]: {8827#true} [8827#true, 8827#true, 8827#true, 9131#(< |ULTIMATE.start_main_~i~0#1| 8), 9118#(< |ULTIMATE.start_main_~i~0#1| 9), 9118#(< |ULTIMATE.start_main_~i~0#1| 9), 9118#(< |ULTIMATE.start_main_~i~0#1| 9), 9118#(< |ULTIMATE.start_main_~i~0#1| 9), 9111#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 9111#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false, 8828#false] {8828#false} [2023-02-13 03:40:36,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-13 03:40:36,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552479205] [2023-02-13 03:40:36,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:40:36,577 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:36,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:36,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:36,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:36,578 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:36,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:36,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:36,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:36,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:40:36,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:36,579 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:36,581 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,584 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,646 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:36,646 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,648 INFO L229 MonitoredProcess]: Starting monitored process 33 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,651 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-13 03:40:36,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:36,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:36,673 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:36,674 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:36,705 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-13 03:40:36,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:36,706 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,707 INFO L229 MonitoredProcess]: Starting monitored process 34 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,709 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-13 03:40:36,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:36,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:36,718 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:36,718 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:36,734 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-02-13 03:40:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,736 INFO L229 MonitoredProcess]: Starting monitored process 35 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,738 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-13 03:40:36,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:36,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:36,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-13 03:40:36,751 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-13 03:40:36,782 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-02-13 03:40:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,784 INFO L229 MonitoredProcess]: Starting monitored process 36 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,787 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-13 03:40:36,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:36,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:36,828 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-02-13 03:40:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:36,829 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,829 INFO L229 MonitoredProcess]: Starting monitored process 37 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,831 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-13 03:40:36,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:36,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:36,844 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:36,883 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-13 03:40:36,883 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:36,883 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:36,883 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:36,883 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:36,883 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:36,884 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:36,884 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:36,884 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:36,884 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop [2023-02-13 03:40:36,884 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:36,884 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:36,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,888 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:36,944 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:36,945 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:36,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:36,945 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,947 INFO L229 MonitoredProcess]: Starting monitored process 38 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,953 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-13 03:40:36,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:36,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:36,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:36,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:36,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:36,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:36,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:36,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:36,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:36,990 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-13 03:40:36,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:36,991 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:36,992 INFO L229 MonitoredProcess]: Starting monitored process 39 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:36,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:36,996 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-13 03:40:37,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:37,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:37,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:37,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:37,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:37,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:37,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:37,047 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:37,047 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:37,048 INFO L229 MonitoredProcess]: Starting monitored process 40 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:37,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:37,050 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-13 03:40:37,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:37,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:37,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:37,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:37,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-13 03:40:37,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-13 03:40:37,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-13 03:40:37,097 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:37,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:37,099 INFO L229 MonitoredProcess]: Starting monitored process 41 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:37,101 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-13 03:40:37,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:37,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:37,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:37,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:37,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:37,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:37,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:37,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:37,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:37,115 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:37,115 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:40:37,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:37,115 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:37,116 INFO L229 MonitoredProcess]: Starting monitored process 42 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:37,119 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:37,119 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-13 03:40:37,119 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:37,120 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:37,120 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-13 03:40:37,156 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-02-13 03:40:37,157 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:37,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:37,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:38,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:38,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,427 INFO L100 LoopCannibalizer]: 4 predicates before loop cannibalization 11 predicates after loop cannibalization [2023-02-13 03:40:39,428 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2023-02-13 03:40:39,429 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 165 states and 198 transitions. cyclomatic complexity: 35 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:39,598 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 165 states and 198 transitions. cyclomatic complexity: 35. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 724 states and 839 transitions. Complement of second has 36 states. [2023-02-13 03:40:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2023-02-13 03:40:39,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 43 transitions. Stem has 4 letters. Loop has 48 letters. [2023-02-13 03:40:39,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:39,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 43 transitions. Stem has 52 letters. Loop has 48 letters. [2023-02-13 03:40:39,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:39,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 43 transitions. Stem has 4 letters. Loop has 96 letters. [2023-02-13 03:40:39,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:39,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 724 states and 839 transitions. [2023-02-13 03:40:39,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2023-02-13 03:40:39,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 724 states to 176 states and 209 transitions. [2023-02-13 03:40:39,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2023-02-13 03:40:39,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-02-13 03:40:39,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 209 transitions. [2023-02-13 03:40:39,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:39,612 INFO L220 hiAutomatonCegarLoop]: Abstraction has 176 states and 209 transitions. [2023-02-13 03:40:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 209 transitions. [2023-02-13 03:40:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2023-02-13 03:40:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.1939393939393939) internal successors, (197), 164 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2023-02-13 03:40:39,617 INFO L242 hiAutomatonCegarLoop]: Abstraction has 165 states and 197 transitions. [2023-02-13 03:40:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:39,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-13 03:40:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-13 03:40:39,617 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:39,666 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2023-02-13 03:40:39,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 196 transitions. [2023-02-13 03:40:39,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 121 [2023-02-13 03:40:39,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 174 states and 187 transitions. [2023-02-13 03:40:39,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2023-02-13 03:40:39,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2023-02-13 03:40:39,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 187 transitions. [2023-02-13 03:40:39,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:39,669 INFO L220 hiAutomatonCegarLoop]: Abstraction has 174 states and 187 transitions. [2023-02-13 03:40:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 187 transitions. [2023-02-13 03:40:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 125. [2023-02-13 03:40:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.08) internal successors, (135), 124 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2023-02-13 03:40:39,671 INFO L242 hiAutomatonCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-02-13 03:40:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 03:40:39,673 INFO L426 stractBuchiCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-02-13 03:40:39,674 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-13 03:40:39,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 135 transitions. [2023-02-13 03:40:39,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2023-02-13 03:40:39,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:39,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:39,677 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-13 03:40:39,677 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2023-02-13 03:40:39,678 INFO L733 eck$LassoCheckResult]: Stem: 16928#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 16929#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16933#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16920#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 16921#L15-1 [2023-02-13 03:40:39,679 INFO L735 eck$LassoCheckResult]: Loop: 16921#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 17019#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 17020#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 17021#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 17022#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 17030#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 17017#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 17018#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 17029#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 17028#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 17027#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 17026#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 17025#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 17024#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 17023#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16939#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16940#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 17044#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 17043#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 17031#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16984#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16983#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16982#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 16979#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16981#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16980#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16978#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16977#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16976#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16975#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16974#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16973#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16972#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16971#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16970#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16969#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16968#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16967#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16966#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16965#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16964#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16963#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16962#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16961#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16960#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16959#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16958#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16957#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16956#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16955#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16954#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16953#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16952#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16951#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16950#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16949#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16948#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16947#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16946#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16945#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 16942#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 16944#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 16943#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 16941#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 16921#L15-1 [2023-02-13 03:40:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2663619, now seen corresponding path program 5 times [2023-02-13 03:40:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:39,680 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698674087] [2023-02-13 03:40:39,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:39,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:39,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:39,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash 468036993, now seen corresponding path program 5 times [2023-02-13 03:40:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:39,689 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669004277] [2023-02-13 03:40:39,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:39,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:39,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:39,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1879523907, now seen corresponding path program 3 times [2023-02-13 03:40:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:39,709 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123980103] [2023-02-13 03:40:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 03:40:39,738 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123980103] [2023-02-13 03:40:39,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123980103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 03:40:39,738 INFO L335 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099763127] [2023-02-13 03:40:39,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-13 03:40:39,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 03:40:39,738 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:39,739 INFO L229 MonitoredProcess]: Starting monitored process 43 with /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 03:40:39,740 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-02-13 03:40:39,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2023-02-13 03:40:39,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 03:40:39,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:39,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:39,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 03:40:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 283 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:39,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099763127] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 03:40:39,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 03:40:39,878 ERROR L197 FreeRefinementEngine]: {17050#true} [17050#true, 17050#true, 17050#true, 17052#(<= |ULTIMATE.start_main_~i~0#1| 0), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false] {17051#false} [2023-02-13 03:40:39,879 ERROR L197 FreeRefinementEngine]: {17050#true} [17050#true, 17050#true, 17050#true, 17052#(<= |ULTIMATE.start_main_~i~0#1| 0), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17053#(<= |ULTIMATE.start_main_~i~0#1| 1), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17054#(<= |ULTIMATE.start_main_~i~0#1| 2), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false] {17051#false} [2023-02-13 03:40:39,879 ERROR L197 FreeRefinementEngine]: {17050#true} [17050#true, 17050#true, 17050#true, 17055#(<= |ULTIMATE.start_main_~i~0#1| 3), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17056#(<= |ULTIMATE.start_main_~i~0#1| 4), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17057#(<= |ULTIMATE.start_main_~i~0#1| 5), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17058#(<= |ULTIMATE.start_main_~i~0#1| 6), 17406#(< |ULTIMATE.start_main_~i~0#1| 8), 17406#(< |ULTIMATE.start_main_~i~0#1| 8), 17406#(< |ULTIMATE.start_main_~i~0#1| 8), 17406#(< |ULTIMATE.start_main_~i~0#1| 8), 17393#(< |ULTIMATE.start_main_~i~0#1| 9), 17393#(< |ULTIMATE.start_main_~i~0#1| 9), 17393#(< |ULTIMATE.start_main_~i~0#1| 9), 17393#(< |ULTIMATE.start_main_~i~0#1| 9), 17386#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 17386#(not (<= 10 |ULTIMATE.start_main_~i~0#1|)), 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false, 17051#false] {17051#false} [2023-02-13 03:40:39,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2023-02-13 03:40:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765005699] [2023-02-13 03:40:39,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 03:40:40,315 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:40,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:40,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:40,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:40,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-13 03:40:40,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:40,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:40,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:40,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:40:40,317 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:40,317 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:40,319 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,328 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,333 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,384 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:40,384 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-13 03:40:40,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:40,387 INFO L229 MonitoredProcess]: Starting monitored process 44 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:40,389 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-13 03:40:40,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-13 03:40:40,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:40,432 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:40,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2023-02-13 03:40:40,433 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:40,434 INFO L229 MonitoredProcess]: Starting monitored process 45 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:40,435 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-13 03:40:40,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-13 03:40:40,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-13 03:40:40,449 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-13 03:40:40,488 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-02-13 03:40:40,488 INFO L210 LassoAnalysis]: Preferences: [2023-02-13 03:40:40,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-13 03:40:40,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-13 03:40:40,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-13 03:40:40,489 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-13 03:40:40,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:40,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-13 03:40:40,490 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-13 03:40:40,490 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Loop [2023-02-13 03:40:40,490 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-13 03:40:40,490 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-13 03:40:40,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,499 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,505 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,507 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-13 03:40:40,548 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-13 03:40:40,548 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-13 03:40:40,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:40,549 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:40,550 INFO L229 MonitoredProcess]: Starting monitored process 46 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:40,553 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-13 03:40:40,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-13 03:40:40,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-13 03:40:40,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-13 03:40:40,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-13 03:40:40,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-13 03:40:40,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-13 03:40:40,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-13 03:40:40,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-13 03:40:40,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-13 03:40:40,576 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-13 03:40:40,577 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-13 03:40:40,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-13 03:40:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /export/starexec/sandbox/solver/Ultimate/z3 [2023-02-13 03:40:40,579 INFO L229 MonitoredProcess]: Starting monitored process 47 with /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-13 03:40:40,582 INFO L327 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-13 03:40:40,582 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-13 03:40:40,583 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-13 03:40:40,583 INFO L513 LassoAnalysis]: Proved termination. [2023-02-13 03:40:40,583 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-13 03:40:40,621 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-02-13 03:40:40,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-13 03:40:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-13 03:40:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:40,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:40,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:41,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:41,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,584 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:42,610 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-02-13 03:40:42,624 INFO L540 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-13 03:40:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:42,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:42,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:43,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:43,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:43,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:43,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:43,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:43,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:43,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:43,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:43,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:43,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:43,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:43,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:44,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:44,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:45,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:45,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:46,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:46,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:47,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 03:40:47,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-13 03:40:47,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 03:40:47,336 INFO L100 LoopCannibalizer]: 8 predicates before loop cannibalization 23 predicates after loop cannibalization [2023-02-13 03:40:47,337 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 23 loop predicates [2023-02-13 03:40:47,338 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 125 states and 135 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:47,770 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 125 states and 135 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 648 states and 684 transitions. Complement of second has 84 states. [2023-02-13 03:40:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2023-02-13 03:40:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2023-02-13 03:40:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 75 transitions. Stem has 4 letters. Loop has 64 letters. [2023-02-13 03:40:47,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:47,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 75 transitions. Stem has 68 letters. Loop has 64 letters. [2023-02-13 03:40:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 75 transitions. Stem has 4 letters. Loop has 128 letters. [2023-02-13 03:40:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-13 03:40:47,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 684 transitions. [2023-02-13 03:40:47,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-13 03:40:47,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 152 states and 162 transitions. [2023-02-13 03:40:47,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2023-02-13 03:40:47,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2023-02-13 03:40:47,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 162 transitions. [2023-02-13 03:40:47,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:47,786 INFO L220 hiAutomatonCegarLoop]: Abstraction has 152 states and 162 transitions. [2023-02-13 03:40:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 162 transitions. [2023-02-13 03:40:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 125. [2023-02-13 03:40:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.072) internal successors, (134), 124 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2023-02-13 03:40:47,790 INFO L242 hiAutomatonCegarLoop]: Abstraction has 125 states and 134 transitions. [2023-02-13 03:40:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 03:40:47,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-13 03:40:47,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-13 03:40:47,790 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 03:40:47,890 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2023-02-13 03:40:47,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 188 transitions. [2023-02-13 03:40:47,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2023-02-13 03:40:47,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 166 states and 178 transitions. [2023-02-13 03:40:47,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2023-02-13 03:40:47,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2023-02-13 03:40:47,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 178 transitions. [2023-02-13 03:40:47,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-13 03:40:47,897 INFO L220 hiAutomatonCegarLoop]: Abstraction has 166 states and 178 transitions. [2023-02-13 03:40:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 178 transitions. [2023-02-13 03:40:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2023-02-13 03:40:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.1008403361344539) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 03:40:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-02-13 03:40:47,903 INFO L242 hiAutomatonCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-02-13 03:40:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-13 03:40:47,905 INFO L426 stractBuchiCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-02-13 03:40:47,906 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-13 03:40:47,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 131 transitions. [2023-02-13 03:40:47,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2023-02-13 03:40:47,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-13 03:40:47,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-13 03:40:47,909 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-13 03:40:47,910 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-13 03:40:47,910 INFO L733 eck$LassoCheckResult]: Stem: 30502#ULTIMATE.startENTRY [57] ULTIMATE.startENTRY-->L18-1: Formula: (= |v_ULTIMATE.start_main_~up~0#1_8| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_14|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_4|, ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_8|, ULTIMATE.start_main_#t~nondet0#1=|v_ULTIMATE.start_main_#t~nondet0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~up~0#1, ULTIMATE.start_main_#t~nondet0#1] 30503#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30508#L12 [2023-02-13 03:40:47,912 INFO L735 eck$LassoCheckResult]: Loop: 30508#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30512#L12-2 [37] L12-2-->L15-1: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_5| 1) (<= |v_ULTIMATE.start_main_~i~0#1_8| 0)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 30513#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30517#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30514#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30510#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30511#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30515#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30516#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30546#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30545#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30544#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30543#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30542#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30541#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30540#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30539#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30538#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30537#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30536#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30535#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30534#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30533#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30532#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30531#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30530#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30529#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30528#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30527#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30526#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30525#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30524#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30523#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30522#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30521#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30520#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30519#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30518#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30504#L15-1 [44] L15-1-->L18-1: Formula: (and (<= 1 |v_ULTIMATE.start_main_~up~0#1_6|) (= |v_ULTIMATE.start_main_~i~0#1_10| (+ |v_ULTIMATE.start_main_~i~0#1_11| 1))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_11|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30505#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30506#L12 [48] L12-->L12-2: Formula: (and (= |v_ULTIMATE.start_main_~up~0#1_4| 0) (<= 10 |v_ULTIMATE.start_main_~i~0#1_6|)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_4|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~up~0#1] 30494#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30495#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30498#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30499#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30507#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30583#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30582#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30581#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30580#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30579#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30578#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30577#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30576#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30575#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30574#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30573#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30572#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30571#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30570#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30569#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30568#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30567#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30566#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30565#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30564#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30563#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30562#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30561#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30560#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30559#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30558#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30557#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30556#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30555#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30554#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30552#L12 [52] L12-->L12-2: Formula: (> 10 |v_ULTIMATE.start_main_~i~0#1_7|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_7|} AuxVars[] AssignedVars[] 30553#L12-2 [53] L12-2-->L15-1: Formula: (> |v_ULTIMATE.start_main_~i~0#1_9| 0) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|} AuxVars[] AssignedVars[] 30585#L15-1 [54] L15-1-->L18-1: Formula: (and (> 1 |v_ULTIMATE.start_main_~up~0#1_7|) (= |v_ULTIMATE.start_main_~i~0#1_12| (+ |v_ULTIMATE.start_main_~i~0#1_13| (- 1)))) InVars {ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_13|} OutVars{ULTIMATE.start_main_~up~0#1=|v_ULTIMATE.start_main_~up~0#1_7|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] 30584#L18-1 [42] L18-1-->L12: Formula: (and (<= 0 |v_ULTIMATE.start_main_~i~0#1_5|) (<= |v_ULTIMATE.start_main_~i~0#1_5| 10)) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] 30508#L12 [2023-02-13 03:40:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2770, now seen corresponding path program 1 times [2023-02-13 03:40:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:47,914 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692274249] [2023-02-13 03:40:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:47,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:47,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 626398589, now seen corresponding path program 6 times [2023-02-13 03:40:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:47,924 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345609552] [2023-02-13 03:40:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:47,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:47,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:47,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 03:40:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 633427534, now seen corresponding path program 4 times [2023-02-13 03:40:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 03:40:47,942 INFO L335 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125685570] [2023-02-13 03:40:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 03:40:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 03:40:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:47,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 03:40:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 03:40:47,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 03:40:48,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.02 03:40:48 BasicIcfg [2023-02-13 03:40:48,558 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-13 03:40:48,558 INFO L158 Benchmark]: Toolchain (without parser) took 16727.39ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 1.2GB in the end (delta: 901.8MB). Peak memory consumption was 902.3MB. Max. memory is 42.9GB. [2023-02-13 03:40:48,558 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:40:48,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.07ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:40:48,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:40:48,559 INFO L158 Benchmark]: Boogie Preprocessor took 9.57ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:40:48,559 INFO L158 Benchmark]: RCFGBuilder took 187.81ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. [2023-02-13 03:40:48,559 INFO L158 Benchmark]: BlockEncodingV2 took 44.26ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:40:48,559 INFO L158 Benchmark]: TraceAbstraction took 13.86ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 42.9GB. [2023-02-13 03:40:48,559 INFO L158 Benchmark]: BuchiAutomizer took 16301.40ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 1.2GB in the end (delta: 870.9MB). Peak memory consumption was 868.8MB. Max. memory is 42.9GB. [2023-02-13 03:40:48,560 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 14 edges - StatisticsResult: Encoded RCFG 5 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 2.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 42.9GB. * CACSL2BoogieTranslator took 138.07ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * Boogie Preprocessor took 9.57ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 42.9GB. * RCFGBuilder took 187.81ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 42.9GB. * BlockEncodingV2 took 44.26ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 42.9GB. * TraceAbstraction took 13.86ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 42.9GB. * BuchiAutomizer took 16301.40ms. Allocated memory is still 2.1GB. Free memory was 2.1GB in the beginning and 1.2GB in the end (delta: 870.9MB). Peak memory consumption was 868.8MB. Max. memory is 42.9GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (9 trivial, 0 deterministic, 7 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 1 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * up + 1 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 17 and consists of 7 locations. One nondeterministic module has affine ranking function i and consists of 7 locations. One nondeterministic module has affine ranking function i and consists of 9 locations. One nondeterministic module has affine ranking function i and consists of 17 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 119 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.2s and 12 iterations. TraceHistogramMax:20. Analysis of lassos took 4.3s. Construction of modules took 0.4s. Büchi inclusion checks took 11.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 224 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 571/968 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 754 IncrementalHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 58 mSDtfsCounter, 754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT2 conc0 concLT5 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax166 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq124 hnf96 smp100 dnf100 smp100 tf112 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4dc58fc3=0, up=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-13 03:40:48,611 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-02-13 03:40:48,810 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-02-13 03:40:49,010 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-02-13 03:40:49,213 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-13 03:40:49,420 INFO L552 MonitoredProcess]: [MP /export/starexec/sandbox/solver/Ultimate/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (1)] Ended with exit code 0 Received shutdown request...