./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:17:23,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:17:23,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-20 22:17:23,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:17:23,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:17:23,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:17:23,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:17:23,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:17:23,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:17:23,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:17:23,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:17:23,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:17:23,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:17:23,849 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:17:23,849 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:17:23,849 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:17:23,850 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:17:23,850 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:17:23,850 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:17:23,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:17:23,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:17:23,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:17:23,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:17:23,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:17:23,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:17:23,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:17:23,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:17:23,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:17:23,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:17:23,853 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:17:23,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:17:23,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:17:23,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:17:23,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:17:23,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:17:23,855 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:17:23,855 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00bfc508b8ea24f88f85b042e795fbae14e8287990a04ebdf542583ad129e19a [2024-11-20 22:17:24,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:17:24,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:17:24,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:17:24,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:17:24,088 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:17:24,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-11-20 22:17:25,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:17:25,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:17:25,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2024-11-20 22:17:25,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a33c476/9e1cec17f5d54a30a9c4930e4e860f8d/FLAGb8b8c7f6b [2024-11-20 22:17:25,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a33c476/9e1cec17f5d54a30a9c4930e4e860f8d [2024-11-20 22:17:25,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:17:25,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:17:25,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:17:25,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:17:25,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:17:25,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:17:25" (1/1) ... [2024-11-20 22:17:25,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45573f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:25, skipping insertion in model container [2024-11-20 22:17:25,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:17:25" (1/1) ... [2024-11-20 22:17:25,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:17:26,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:17:26,270 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:17:26,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:17:26,375 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:17:26,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26 WrapperNode [2024-11-20 22:17:26,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:17:26,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:17:26,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:17:26,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:17:26,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,426 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-20 22:17:26,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:17:26,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:17:26,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:17:26,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:17:26,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,459 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-20 22:17:26,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:17:26,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:17:26,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:17:26,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:17:26,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (1/1) ... [2024-11-20 22:17:26,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:26,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:26,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:17:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:17:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:17:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:17:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:17:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:17:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:17:26,625 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:17:26,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:17:26,740 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 22:17:26,740 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:17:26,750 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:17:26,751 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 22:17:26,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:17:26 BoogieIcfgContainer [2024-11-20 22:17:26,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:17:26,752 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:17:26,752 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:17:26,755 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:17:26,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:17:26,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:17:25" (1/3) ... [2024-11-20 22:17:26,756 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@515fbd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:17:26, skipping insertion in model container [2024-11-20 22:17:26,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:17:26,757 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:17:26" (2/3) ... [2024-11-20 22:17:26,758 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@515fbd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:17:26, skipping insertion in model container [2024-11-20 22:17:26,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:17:26,758 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:17:26" (3/3) ... [2024-11-20 22:17:26,759 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2024-11-20 22:17:26,800 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:17:26,800 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:17:26,801 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:17:26,801 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:17:26,801 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:17:26,801 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:17:26,801 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:17:26,802 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:17:26,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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) [2024-11-20 22:17:26,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-20 22:17:26,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:26,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:26,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-20 22:17:26,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:26,822 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:17:26,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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) [2024-11-20 22:17:26,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-20 22:17:26,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:26,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:26,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-20 22:17:26,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:26,830 INFO L745 eck$LassoCheckResult]: Stem: 13#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 14#L367true assume !(main_~length~0#1 < 1); 9#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 6#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2#L371-3true [2024-11-20 22:17:26,830 INFO L747 eck$LassoCheckResult]: Loop: 2#L371-3true assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 12#L371-2true main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2#L371-3true [2024-11-20 22:17:26,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-11-20 22:17:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:26,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961870827] [2024-11-20 22:17:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:26,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:26,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:26,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2024-11-20 22:17:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685735590] [2024-11-20 22:17:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:26,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:26,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2024-11-20 22:17:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:26,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535418412] [2024-11-20 22:17:26,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:26,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:27,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:27,266 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:17:27,267 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:17:27,267 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:17:27,267 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:17:27,267 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:17:27,267 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,267 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:17:27,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:17:27,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2024-11-20 22:17:27,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:17:27,268 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:17:27,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:27,795 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:17:27,798 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:17:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-20 22:17:27,804 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 [2024-11-20 22:17:27,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:17:27,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-20 22:17:27,837 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 [2024-11-20 22:17:27,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:27,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-20 22:17:27,865 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 [2024-11-20 22:17:27,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-20 22:17:27,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-20 22:17:27,892 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 [2024-11-20 22:17:27,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:27,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-20 22:17:27,916 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 [2024-11-20 22:17:27,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-20 22:17:27,941 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 [2024-11-20 22:17:27,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-20 22:17:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:17:27,971 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 [2024-11-20 22:17:27,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:27,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:27,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:27,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:27,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:27,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:27,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:27,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:27,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-20 22:17:27,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:27,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:27,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:17:27,993 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 [2024-11-20 22:17:28,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:28,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:28,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:28,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:28,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:28,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:28,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:28,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-20 22:17:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:28,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:28,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:17:28,022 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 [2024-11-20 22:17:28,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:28,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:28,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:28,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:28,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:28,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:28,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:17:28,085 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-20 22:17:28,085 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:17:28,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:28,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:28,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:28,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:17:28,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:17:28,101 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:17:28,102 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:17:28,102 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-20 22:17:28,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:17:28,123 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2024-11-20 22:17:28,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:17:28,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:17:28,132 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-11-20 22:17:28,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:28,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:17:28,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:28,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:17:28,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:28,214 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:17:28,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-20 22:17:28,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 30 states and 42 transitions. Complement of second has 6 states. [2024-11-20 22:17:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-20 22:17:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-20 22:17:28,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-20 22:17:28,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:28,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-20 22:17:28,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:28,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-20 22:17:28,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:28,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 42 transitions. [2024-11-20 22:17:28,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:17:28,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2024-11-20 22:17:28,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:28,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-20 22:17:28,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-20 22:17:28,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:17:28,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-20 22:17:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-20 22:17:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-20 22:17:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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) [2024-11-20 22:17:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-20 22:17:28,343 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-20 22:17:28,344 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-20 22:17:28,344 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:17:28,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-20 22:17:28,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:17:28,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:28,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:28,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:28,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-20 22:17:28,347 INFO L745 eck$LassoCheckResult]: Stem: 121#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 123#L367 assume !(main_~length~0#1 < 1); 119#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 120#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 113#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 114#L371-4 main_~j~0#1 := 0; 112#L374-3 [2024-11-20 22:17:28,348 INFO L747 eck$LassoCheckResult]: Loop: 112#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 117#L375-3 assume !true; 111#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 112#L374-3 [2024-11-20 22:17:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2024-11-20 22:17:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308013143] [2024-11-20 22:17:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash 65925, now seen corresponding path program 1 times [2024-11-20 22:17:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175878595] [2024-11-20 22:17:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:28,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175878595] [2024-11-20 22:17:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175878595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:17:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:17:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 22:17:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564675782] [2024-11-20 22:17:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:17:28,395 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:17:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:28,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 22:17:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 22:17:28,398 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-20 22:17:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:28,401 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2024-11-20 22:17:28,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2024-11-20 22:17:28,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:17:28,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2024-11-20 22:17:28,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-20 22:17:28,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-20 22:17:28,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2024-11-20 22:17:28,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:17:28,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-20 22:17:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2024-11-20 22:17:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-20 22:17:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 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) [2024-11-20 22:17:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-11-20 22:17:28,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-20 22:17:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 22:17:28,404 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-11-20 22:17:28,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:17:28,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-11-20 22:17:28,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:17:28,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:28,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:28,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:28,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:17:28,405 INFO L745 eck$LassoCheckResult]: Stem: 152#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 142#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 143#L371-4 main_~j~0#1 := 0; 147#L374-3 [2024-11-20 22:17:28,405 INFO L747 eck$LassoCheckResult]: Loop: 147#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 150#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 151#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 146#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 147#L374-3 [2024-11-20 22:17:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 2 times [2024-11-20 22:17:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975972119] [2024-11-20 22:17:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2024-11-20 22:17:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122497520] [2024-11-20 22:17:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2024-11-20 22:17:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:28,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853210390] [2024-11-20 22:17:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:28,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:28,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-20 22:17:28,674 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:17:28,674 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:17:28,674 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:17:28,674 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:17:28,675 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:17:28,675 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:28,675 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:17:28,675 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:17:28,675 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2024-11-20 22:17:28,675 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:17:28,675 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:17:28,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:28,922 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:17:28,923 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:17:28,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:28,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:28,925 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:28,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-20 22:17:28,927 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 [2024-11-20 22:17:28,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:28,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:28,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:28,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:28,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:28,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:28,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:28,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:28,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-20 22:17:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:28,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:28,953 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:28,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-20 22:17:28,958 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 [2024-11-20 22:17:28,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:28,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:28,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:28,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:28,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:28,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:28,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:28,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:28,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:28,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:28,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:17:28,983 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 [2024-11-20 22:17:28,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:28,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:28,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:28,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:28,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:28,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:28,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:28,995 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:29,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-20 22:17:29,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:29,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,002 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:17:29,005 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 [2024-11-20 22:17:29,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:29,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:29,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:29,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:29,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:29,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:29,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:29,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:29,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-20 22:17:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:17:29,026 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 [2024-11-20 22:17:29,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:29,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:29,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:29,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:29,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:29,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:29,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:29,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:29,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:29,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:29,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,047 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:17:29,052 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 [2024-11-20 22:17:29,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:29,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:29,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:29,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:29,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:29,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:29,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:29,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:29,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,085 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:17:29,089 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 [2024-11-20 22:17:29,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:29,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:29,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:29,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:29,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:29,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:29,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:29,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:17:29,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:29,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:17:29,115 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 [2024-11-20 22:17:29,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:29,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:29,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:29,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:29,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:29,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:29,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:17:29,149 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-20 22:17:29,150 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-20 22:17:29,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:29,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,152 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-20 22:17:29,154 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:17:29,165 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-20 22:17:29,165 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:17:29,165 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2024-11-20 22:17:29,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:29,182 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-11-20 22:17:29,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:17:29,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:17:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:29,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:17:29,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:29,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:17:29,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:29,302 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-20 22:17:29,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-20 22:17:29,360 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 19 states and 25 transitions. Complement of second has 7 states. [2024-11-20 22:17:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-20 22:17:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2024-11-20 22:17:29,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-20 22:17:29,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:29,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-20 22:17:29,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:29,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2024-11-20 22:17:29,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:29,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2024-11-20 22:17:29,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:29,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2024-11-20 22:17:29,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:29,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-20 22:17:29,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-11-20 22:17:29,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:29,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-11-20 22:17:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-11-20 22:17:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-20 22:17:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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) [2024-11-20 22:17:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-11-20 22:17:29,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-20 22:17:29,371 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-11-20 22:17:29,371 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:17:29,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2024-11-20 22:17:29,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:29,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:29,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:29,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:29,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:29,372 INFO L745 eck$LassoCheckResult]: Stem: 264#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 266#L367 assume !(main_~length~0#1 < 1); 258#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 259#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 252#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 253#L371-4 main_~j~0#1 := 0; 267#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 260#L375-3 [2024-11-20 22:17:29,373 INFO L747 eck$LassoCheckResult]: Loop: 260#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 261#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 260#L375-3 [2024-11-20 22:17:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2024-11-20 22:17:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629943343] [2024-11-20 22:17:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:29,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2024-11-20 22:17:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821991696] [2024-11-20 22:17:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:29,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2024-11-20 22:17:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224662945] [2024-11-20 22:17:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:29,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224662945] [2024-11-20 22:17:29,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224662945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:17:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:17:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 22:17:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398450056] [2024-11-20 22:17:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:17:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:29,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:17:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:17:29,625 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2024-11-20 22:17:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:29,657 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-11-20 22:17:29,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2024-11-20 22:17:29,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:29,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2024-11-20 22:17:29,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-20 22:17:29,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-20 22:17:29,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2024-11-20 22:17:29,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:29,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-11-20 22:17:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2024-11-20 22:17:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2024-11-20 22:17:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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) [2024-11-20 22:17:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-20 22:17:29,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-20 22:17:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:17:29,661 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-20 22:17:29,661 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:17:29,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-11-20 22:17:29,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:29,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:29,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:29,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:29,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:29,662 INFO L745 eck$LassoCheckResult]: Stem: 320#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 322#L367 assume !(main_~length~0#1 < 1); 314#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 315#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 308#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 309#L371-4 main_~j~0#1 := 0; 323#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 318#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 319#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 312#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 313#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 316#L375-3 [2024-11-20 22:17:29,662 INFO L747 eck$LassoCheckResult]: Loop: 316#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 317#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 316#L375-3 [2024-11-20 22:17:29,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2024-11-20 22:17:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540234003] [2024-11-20 22:17:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:29,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540234003] [2024-11-20 22:17:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540234003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:29,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042244203] [2024-11-20 22:17:29,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:17:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:29,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:29,739 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:29,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-20 22:17:29,793 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:17:29,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:29,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 22:17:29,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:29,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:29,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 22:17:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042244203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:17:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 22:17:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-20 22:17:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640237978] [2024-11-20 22:17:29,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:17:29,846 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2024-11-20 22:17:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188910852] [2024-11-20 22:17:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:17:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 22:17:29,889 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2024-11-20 22:17:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:29,932 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-20 22:17:29,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2024-11-20 22:17:29,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:29,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 19 states and 22 transitions. [2024-11-20 22:17:29,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:29,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:29,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-20 22:17:29,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:29,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-20 22:17:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-20 22:17:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-20 22:17:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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) [2024-11-20 22:17:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-20 22:17:29,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-20 22:17:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:17:29,935 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-20 22:17:29,935 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:17:29,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-20 22:17:29,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:29,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:29,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:29,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:29,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:29,936 INFO L745 eck$LassoCheckResult]: Stem: 415#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 416#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 417#L367 assume !(main_~length~0#1 < 1); 413#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 414#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 403#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 404#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 405#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 406#L371-4 main_~j~0#1 := 0; 419#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 420#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 418#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 407#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 408#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 409#L375-3 [2024-11-20 22:17:29,936 INFO L747 eck$LassoCheckResult]: Loop: 409#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 410#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 409#L375-3 [2024-11-20 22:17:29,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2024-11-20 22:17:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015395286] [2024-11-20 22:17:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:29,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2024-11-20 22:17:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110876102] [2024-11-20 22:17:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2024-11-20 22:17:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533075882] [2024-11-20 22:17:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:29,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:30,203 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:17:30,203 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:17:30,203 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:17:30,203 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:17:30,203 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:17:30,203 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,203 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:17:30,203 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:17:30,203 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2024-11-20 22:17:30,203 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:17:30,203 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:17:30,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:30,477 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:17:30,478 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:17:30,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,506 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-20 22:17:30,508 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 [2024-11-20 22:17:30,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:30,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:30,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:30,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,536 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-20 22:17:30,542 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 [2024-11-20 22:17:30,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:30,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:30,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:30,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,572 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-20 22:17:30,575 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 [2024-11-20 22:17:30,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:30,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:30,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:30,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,595 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-20 22:17:30,597 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 [2024-11-20 22:17:30,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,625 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,627 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 [2024-11-20 22:17:30,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-20 22:17:30,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:30,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:30,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:30,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,652 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-20 22:17:30,656 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 [2024-11-20 22:17:30,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:30,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:30,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:30,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,675 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-20 22:17:30,681 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 [2024-11-20 22:17:30,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,715 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-20 22:17:30,718 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 [2024-11-20 22:17:30,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,766 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-20 22:17:30,769 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 [2024-11-20 22:17:30,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,792 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-20 22:17:30,795 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 [2024-11-20 22:17:30,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,817 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-20 22:17:30,819 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 [2024-11-20 22:17:30,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:30,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,842 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-20 22:17:30,844 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 [2024-11-20 22:17:30,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:30,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:30,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:30,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:30,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:30,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:30,866 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:17:30,878 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-20 22:17:30,878 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-20 22:17:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:30,880 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:30,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-20 22:17:30,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:17:30,893 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:17:30,893 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:17:30,894 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 4))_1 Supporting invariants [] [2024-11-20 22:17:30,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:30,911 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-20 22:17:30,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 22:17:30,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 22:17:30,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-20 22:17:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:30,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:17:30,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:30,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:30,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:31,018 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-20 22:17:31,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 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) [2024-11-20 22:17:31,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. 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 18 states and 21 transitions. Complement of second has 4 states. [2024-11-20 22:17:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:31,057 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) [2024-11-20 22:17:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-20 22:17:31,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-20 22:17:31,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:31,057 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:17:31,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-20 22:17:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:31,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:17:31,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:31,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:31,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:31,204 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-20 22:17:31,204 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 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) [2024-11-20 22:17:31,223 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. 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 18 states and 21 transitions. Complement of second has 4 states. [2024-11-20 22:17:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:31,225 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) [2024-11-20 22:17:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2024-11-20 22:17:31,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-20 22:17:31,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:31,225 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:17:31,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:31,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 22:17:31,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:31,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:31,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:31,363 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-20 22:17:31,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 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) [2024-11-20 22:17:31,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. 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 32 states and 38 transitions. Complement of second has 10 states. [2024-11-20 22:17:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-20 22:17:31,458 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) [2024-11-20 22:17:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2024-11-20 22:17:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-20 22:17:31,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 16 letters. Loop has 2 letters. [2024-11-20 22:17:31,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-20 22:17:31,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:31,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 38 transitions. [2024-11-20 22:17:31,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:31,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2024-11-20 22:17:31,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-20 22:17:31,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-20 22:17:31,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-11-20 22:17:31,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:31,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-20 22:17:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-11-20 22:17:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-20 22:17:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 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) [2024-11-20 22:17:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-20 22:17:31,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-20 22:17:31,462 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-20 22:17:31,462 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:17:31,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2024-11-20 22:17:31,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:31,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:31,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:31,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:31,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:31,463 INFO L745 eck$LassoCheckResult]: Stem: 720#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 722#L367 assume !(main_~length~0#1 < 1); 718#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 719#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 710#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 711#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 712#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 713#L371-4 main_~j~0#1 := 0; 725#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 726#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 729#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 728#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 727#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 724#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 730#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 708#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 709#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 714#L375-3 [2024-11-20 22:17:31,463 INFO L747 eck$LassoCheckResult]: Loop: 714#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 715#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 714#L375-3 [2024-11-20 22:17:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1706672357, now seen corresponding path program 2 times [2024-11-20 22:17:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285944928] [2024-11-20 22:17:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285944928] [2024-11-20 22:17:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285944928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708239790] [2024-11-20 22:17:31,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:17:31,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:31,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:31,566 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:31,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-20 22:17:31,607 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:17:31,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:31,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:17:31,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:31,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:17:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708239790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:17:31,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:17:31,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-20 22:17:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809319838] [2024-11-20 22:17:31,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:17:31,742 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:31,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 4 times [2024-11-20 22:17:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:31,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3034422] [2024-11-20 22:17:31,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:31,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:31,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:31,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:17:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:17:31,800 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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) [2024-11-20 22:17:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:31,857 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-20 22:17:31,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2024-11-20 22:17:31,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:31,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 26 states and 30 transitions. [2024-11-20 22:17:31,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:31,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:31,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2024-11-20 22:17:31,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:31,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-20 22:17:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2024-11-20 22:17:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-20 22:17:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 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) [2024-11-20 22:17:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-20 22:17:31,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:17:31,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 22:17:31,860 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-20 22:17:31,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:17:31,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-11-20 22:17:31,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:31,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:31,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:31,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:31,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:31,861 INFO L745 eck$LassoCheckResult]: Stem: 899#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 900#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 901#L367 assume !(main_~length~0#1 < 1); 892#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 893#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 886#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 887#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 888#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 889#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 898#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 904#L371-4 main_~j~0#1 := 0; 905#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 906#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 910#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 890#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 891#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 903#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 909#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 908#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 907#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 894#L375-3 [2024-11-20 22:17:31,861 INFO L747 eck$LassoCheckResult]: Loop: 894#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 895#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 894#L375-3 [2024-11-20 22:17:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1762185767, now seen corresponding path program 3 times [2024-11-20 22:17:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262790312] [2024-11-20 22:17:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:32,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:32,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262790312] [2024-11-20 22:17:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262790312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:32,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659812452] [2024-11-20 22:17:32,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:17:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:32,181 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:32,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-20 22:17:32,219 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 22:17:32,219 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:32,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 22:17:32,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:32,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:17:32,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 22:17:32,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 22:17:32,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 22:17:32,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:32,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2024-11-20 22:17:32,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:32,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-20 22:17:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:32,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:17:32,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-20 22:17:32,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 22:17:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659812452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:17:32,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:17:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2024-11-20 22:17:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996486424] [2024-11-20 22:17:32,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:17:32,595 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:32,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:32,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 5 times [2024-11-20 22:17:32,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:32,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600404110] [2024-11-20 22:17:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 22:17:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-11-20 22:17:32,625 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 8 Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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) [2024-11-20 22:17:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:32,721 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-20 22:17:32,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-11-20 22:17:32,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:32,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 31 transitions. [2024-11-20 22:17:32,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:32,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:32,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-11-20 22:17:32,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:32,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-20 22:17:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-11-20 22:17:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-20 22:17:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 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) [2024-11-20 22:17:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-20 22:17:32,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-20 22:17:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 22:17:32,724 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-20 22:17:32,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:17:32,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-11-20 22:17:32,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:32,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:32,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:32,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:32,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:32,726 INFO L745 eck$LassoCheckResult]: Stem: 1092#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1093#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1094#L367 assume !(main_~length~0#1 < 1); 1086#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1087#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1080#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1081#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1082#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1083#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1105#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 1097#L371-4 main_~j~0#1 := 0; 1098#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1099#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1104#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1084#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1085#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1100#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1095#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1096#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1103#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1102#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1101#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1088#L375-3 [2024-11-20 22:17:32,726 INFO L747 eck$LassoCheckResult]: Loop: 1088#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1089#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1088#L375-3 [2024-11-20 22:17:32,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1241819266, now seen corresponding path program 2 times [2024-11-20 22:17:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:32,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346276699] [2024-11-20 22:17:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 6 times [2024-11-20 22:17:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068653438] [2024-11-20 22:17:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash 612594979, now seen corresponding path program 3 times [2024-11-20 22:17:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410751004] [2024-11-20 22:17:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:32,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:33,206 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:17:33,206 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:17:33,206 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:17:33,206 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:17:33,206 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:17:33,206 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,206 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:17:33,206 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:17:33,206 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2024-11-20 22:17:33,206 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:17:33,206 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:17:33,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:33,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:17:33,552 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:17:33,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,555 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-20 22:17:33,556 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 [2024-11-20 22:17:33,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,577 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-20 22:17:33,579 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 [2024-11-20 22:17:33,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,608 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-20 22:17:33,610 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 [2024-11-20 22:17:33,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,630 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-20 22:17:33,634 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 [2024-11-20 22:17:33,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,659 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-20 22:17:33,662 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 [2024-11-20 22:17:33,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-20 22:17:33,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,697 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-20 22:17:33,698 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 [2024-11-20 22:17:33,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,722 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-20 22:17:33,724 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 [2024-11-20 22:17:33,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:33,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,745 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-20 22:17:33,746 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 [2024-11-20 22:17:33,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:33,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:33,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:33,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:33,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:33,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:33,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:17:33,775 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-20 22:17:33,775 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-20 22:17:33,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:33,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:33,777 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:33,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-20 22:17:33,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:17:33,789 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:17:33,790 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:17:33,790 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 8)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 8)_1 Supporting invariants [] [2024-11-20 22:17:33,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:33,818 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-20 22:17:33,820 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 22:17:33,820 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 22:17:33,820 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-20 22:17:33,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:33,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 22:17:33,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:33,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:33,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:34,006 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-20 22:17:34,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-11-20 22:17:34,042 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 26 states and 30 transitions. Complement of second has 5 states. [2024-11-20 22:17:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-11-20 22:17:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:17:34,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 22 letters. Loop has 2 letters. [2024-11-20 22:17:34,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:34,043 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:17:34,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:34,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 22:17:34,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:34,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:34,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:34,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-11-20 22:17:34,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-11-20 22:17:34,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 26 states and 30 transitions. Complement of second has 5 states. [2024-11-20 22:17:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2024-11-20 22:17:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:17:34,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 22 letters. Loop has 2 letters. [2024-11-20 22:17:34,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:34,230 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:17:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:34,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 22:17:34,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:34,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:34,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:34,373 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-11-20 22:17:34,373 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-20 22:17:34,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 40 states and 47 transitions. Complement of second has 13 states. [2024-11-20 22:17:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-20 22:17:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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) [2024-11-20 22:17:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-11-20 22:17:34,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 22 letters. Loop has 2 letters. [2024-11-20 22:17:34,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:34,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 24 letters. Loop has 2 letters. [2024-11-20 22:17:34,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:34,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 22 letters. Loop has 4 letters. [2024-11-20 22:17:34,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:34,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-11-20 22:17:34,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:34,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 40 transitions. [2024-11-20 22:17:34,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-20 22:17:34,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-20 22:17:34,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2024-11-20 22:17:34,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:34,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-20 22:17:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2024-11-20 22:17:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-20 22:17:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 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) [2024-11-20 22:17:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-20 22:17:34,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-20 22:17:34,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-20 22:17:34,445 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:17:34,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2024-11-20 22:17:34,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:34,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:34,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:34,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:34,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:34,446 INFO L745 eck$LassoCheckResult]: Stem: 1542#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1544#L367 assume !(main_~length~0#1 < 1); 1539#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1540#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1529#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1530#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1531#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1532#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1541#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 1546#L371-4 main_~j~0#1 := 0; 1547#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1548#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1554#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1555#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1559#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1537#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1538#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1545#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1558#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1533#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1534#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1549#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1553#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1552#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1550#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1535#L375-3 [2024-11-20 22:17:34,446 INFO L747 eck$LassoCheckResult]: Loop: 1535#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1536#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1535#L375-3 [2024-11-20 22:17:34,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 293254931, now seen corresponding path program 4 times [2024-11-20 22:17:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:34,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164057487] [2024-11-20 22:17:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:34,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 22:17:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164057487] [2024-11-20 22:17:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164057487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702256224] [2024-11-20 22:17:34,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 22:17:34,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:34,597 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:34,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-20 22:17:34,637 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 22:17:34,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:34,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 22:17:34,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 22:17:34,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:17:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 22:17:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702256224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:17:34,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:17:34,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-20 22:17:34,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952267557] [2024-11-20 22:17:34,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:17:34,755 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:34,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 7 times [2024-11-20 22:17:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221404615] [2024-11-20 22:17:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:34,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:34,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 22:17:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-20 22:17:34,798 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. cyclomatic complexity: 10 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 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) [2024-11-20 22:17:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:34,881 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-11-20 22:17:34,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2024-11-20 22:17:34,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:34,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 34 states and 39 transitions. [2024-11-20 22:17:34,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:34,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:34,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2024-11-20 22:17:34,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:34,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-20 22:17:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2024-11-20 22:17:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-20 22:17:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 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) [2024-11-20 22:17:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-20 22:17:34,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-20 22:17:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 22:17:34,887 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-20 22:17:34,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:17:34,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2024-11-20 22:17:34,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:34,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:34,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:34,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:34,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:34,888 INFO L745 eck$LassoCheckResult]: Stem: 1792#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1793#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1794#L367 assume !(main_~length~0#1 < 1); 1785#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1786#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 1779#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1780#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1781#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1782#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1791#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 1805#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 1804#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 1796#L371-4 main_~j~0#1 := 0; 1797#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1798#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1810#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1809#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1799#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1789#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1790#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1795#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1811#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1783#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1784#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1807#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1803#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1802#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1800#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 1787#L375-3 [2024-11-20 22:17:34,888 INFO L747 eck$LassoCheckResult]: Loop: 1787#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1788#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 1787#L375-3 [2024-11-20 22:17:34,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 136841169, now seen corresponding path program 5 times [2024-11-20 22:17:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724590288] [2024-11-20 22:17:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:35,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:35,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724590288] [2024-11-20 22:17:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724590288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593762453] [2024-11-20 22:17:35,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 22:17:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:35,323 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:35,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-20 22:17:35,382 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-20 22:17:35,383 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:35,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 22:17:35,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:35,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:17:35,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 22:17:35,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:35,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-11-20 22:17:35,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:35,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 33 [2024-11-20 22:17:35,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:35,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-20 22:17:35,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:35,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 15 [2024-11-20 22:17:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:35,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:17:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 22:17:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593762453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:17:39,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:17:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 34 [2024-11-20 22:17:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591755365] [2024-11-20 22:17:39,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:17:39,469 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 8 times [2024-11-20 22:17:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423812813] [2024-11-20 22:17:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:39,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:39,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:39,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-20 22:17:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=984, Unknown=1, NotChecked=0, Total=1122 [2024-11-20 22:17:39,501 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 10 Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 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) [2024-11-20 22:17:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:40,222 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-20 22:17:40,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-11-20 22:17:40,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:40,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 58 states and 66 transitions. [2024-11-20 22:17:40,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:40,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:40,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-20 22:17:40,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:40,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-20 22:17:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-20 22:17:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2024-11-20 22:17:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 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) [2024-11-20 22:17:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-20 22:17:40,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-20 22:17:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-20 22:17:40,238 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-20 22:17:40,238 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-20 22:17:40,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2024-11-20 22:17:40,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:40,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:40,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:40,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:40,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:40,243 INFO L745 eck$LassoCheckResult]: Stem: 2128#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2130#L367 assume !(main_~length~0#1 < 1); 2125#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2126#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2117#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2118#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2143#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2127#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2119#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2120#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2138#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 2132#L371-4 main_~j~0#1 := 0; 2133#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2134#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2149#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2115#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2116#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2123#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2124#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2131#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2150#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2148#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2147#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2146#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2145#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2144#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2141#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2142#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2139#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2137#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2135#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2121#L375-3 [2024-11-20 22:17:40,243 INFO L747 eck$LassoCheckResult]: Loop: 2121#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2122#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2121#L375-3 [2024-11-20 22:17:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2103364059, now seen corresponding path program 6 times [2024-11-20 22:17:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650899749] [2024-11-20 22:17:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:40,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:40,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 9 times [2024-11-20 22:17:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418178993] [2024-11-20 22:17:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:40,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:40,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:40,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1596734400, now seen corresponding path program 7 times [2024-11-20 22:17:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963091840] [2024-11-20 22:17:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:40,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:40,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:41,174 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:17:41,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:17:41,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:17:41,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:17:41,175 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:17:41,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:17:41,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:17:41,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2024-11-20 22:17:41,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:17:41,175 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:17:41,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:17:41,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:17:41,550 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:17:41,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,554 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-20 22:17:41,558 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 [2024-11-20 22:17:41,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:41,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:41,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-20 22:17:41,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,579 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-20 22:17:41,581 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 [2024-11-20 22:17:41,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:41,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,600 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-20 22:17:41,602 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 [2024-11-20 22:17:41,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:41,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,631 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-20 22:17:41,634 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 [2024-11-20 22:17:41,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:41,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,652 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-20 22:17:41,655 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 [2024-11-20 22:17:41,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-20 22:17:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,674 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-20 22:17:41,676 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 [2024-11-20 22:17:41,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-20 22:17:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,697 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-20 22:17:41,699 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 [2024-11-20 22:17:41,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:41,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,720 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-20 22:17:41,722 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 [2024-11-20 22:17:41,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:17:41,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:17:41,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:17:41,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-20 22:17:41,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,749 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-20 22:17:41,750 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 [2024-11-20 22:17:41,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:41,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:41,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-20 22:17:41,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,778 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-20 22:17:41,781 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 [2024-11-20 22:17:41,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:41,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:41,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:17:41,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-20 22:17:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,802 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-20 22:17:41,804 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 [2024-11-20 22:17:41,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:17:41,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:17:41,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:17:41,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:17:41,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:17:41,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:17:41,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:17:41,836 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-20 22:17:41,836 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-20 22:17:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:17:41,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:41,838 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:17:41,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-20 22:17:41,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:17:41,852 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:17:41,853 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:17:41,853 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 12)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 12)_1 Supporting invariants [] [2024-11-20 22:17:41,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-20 22:17:41,870 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-20 22:17:41,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 22:17:41,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 22:17:41,872 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-20 22:17:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:41,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 22:17:41,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:42,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:42,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:42,090 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-20 22:17:42,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-20 22:17:42,133 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 36 states and 41 transitions. Complement of second has 5 states. [2024-11-20 22:17:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-20 22:17:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:17:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-20 22:17:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:42,135 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:17:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:42,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 22:17:42,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:42,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:42,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:42,358 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-20 22:17:42,358 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-20 22:17:42,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 36 states and 41 transitions. Complement of second has 5 states. [2024-11-20 22:17:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:17:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-20 22:17:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:17:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-20 22:17:42,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:42,399 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:17:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:42,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 22:17:42,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:42,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:17:42,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:42,625 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-20 22:17:42,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-20 22:17:42,783 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 10. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 50 states and 58 transitions. Complement of second has 15 states. [2024-11-20 22:17:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-20 22:17:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-20 22:17:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2024-11-20 22:17:42,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-20 22:17:42,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:42,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 34 letters. Loop has 2 letters. [2024-11-20 22:17:42,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:42,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-20 22:17:42,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:17:42,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-20 22:17:42,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:42,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 51 transitions. [2024-11-20 22:17:42,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-20 22:17:42,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-20 22:17:42,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-11-20 22:17:42,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:42,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-20 22:17:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-11-20 22:17:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-11-20 22:17:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 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) [2024-11-20 22:17:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-20 22:17:42,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-20 22:17:42,789 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-20 22:17:42,789 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-20 22:17:42,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-11-20 22:17:42,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:42,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:42,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:42,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:42,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:42,791 INFO L745 eck$LassoCheckResult]: Stem: 2702#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2703#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2704#L367 assume !(main_~length~0#1 < 1); 2699#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2700#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 2689#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2690#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2691#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2692#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2701#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 2711#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 2710#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 2706#L371-4 main_~j~0#1 := 0; 2707#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2708#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2729#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2727#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2709#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2697#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2698#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2705#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2728#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2693#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2694#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2726#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2725#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2724#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2723#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2722#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2721#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2720#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2717#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2718#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2715#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2714#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2712#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 2695#L375-3 [2024-11-20 22:17:42,791 INFO L747 eck$LassoCheckResult]: Loop: 2695#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2696#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 2695#L375-3 [2024-11-20 22:17:42,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1158434064, now seen corresponding path program 8 times [2024-11-20 22:17:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:42,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369601151] [2024-11-20 22:17:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:42,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-20 22:17:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 31 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:17:42,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369601151] [2024-11-20 22:17:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369601151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013821157] [2024-11-20 22:17:42,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:17:42,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:42,976 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:42,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-11-20 22:17:43,041 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:17:43,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:43,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 22:17:43,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:17:43,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:17:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:17:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013821157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:17:43,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:17:43,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2024-11-20 22:17:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704764604] [2024-11-20 22:17:43,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:17:43,241 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 10 times [2024-11-20 22:17:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216306420] [2024-11-20 22:17:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:43,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:43,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 22:17:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-20 22:17:43,273 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 12 Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 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) [2024-11-20 22:17:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:43,390 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-11-20 22:17:43,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 78 transitions. [2024-11-20 22:17:43,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:43,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 44 states and 50 transitions. [2024-11-20 22:17:43,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:43,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:43,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2024-11-20 22:17:43,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:43,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-20 22:17:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2024-11-20 22:17:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-20 22:17:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 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) [2024-11-20 22:17:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-20 22:17:43,396 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-20 22:17:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:17:43,397 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-20 22:17:43,397 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-20 22:17:43,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2024-11-20 22:17:43,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:43,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:43,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:43,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:43,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:43,398 INFO L745 eck$LassoCheckResult]: Stem: 3043#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3045#L367 assume !(main_~length~0#1 < 1); 3041#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3042#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3033#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3034#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3035#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3036#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3058#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3057#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3056#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3054#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3053#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 3047#L371-4 main_~j~0#1 := 0; 3048#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3049#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3073#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3031#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3032#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3039#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3040#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3046#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3072#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3071#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3070#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3069#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3068#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3067#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3066#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3065#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3064#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3063#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3061#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3059#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3055#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3052#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3050#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3037#L375-3 [2024-11-20 22:17:43,398 INFO L747 eck$LassoCheckResult]: Loop: 3037#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3038#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3037#L375-3 [2024-11-20 22:17:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -151409106, now seen corresponding path program 9 times [2024-11-20 22:17:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960239396] [2024-11-20 22:17:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 22:17:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960239396] [2024-11-20 22:17:44,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960239396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:44,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327864895] [2024-11-20 22:17:44,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:17:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:44,160 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:44,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-11-20 22:17:44,233 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 22:17:44,234 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:44,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 22:17:44,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:44,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:17:44,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 22:17:44,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:44,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-11-20 22:17:44,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:44,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2024-11-20 22:17:44,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:44,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 45 [2024-11-20 22:17:44,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:44,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-11-20 22:17:44,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:44,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-11-20 22:17:44,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:44,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2024-11-20 22:17:45,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:45,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 18 [2024-11-20 22:17:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:45,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:17:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:17:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327864895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:17:52,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:17:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 45 [2024-11-20 22:17:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833572150] [2024-11-20 22:17:52,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:17:52,556 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:17:52,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 11 times [2024-11-20 22:17:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993505817] [2024-11-20 22:17:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:52,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:17:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:17:52,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:17:52,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:17:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-20 22:17:52,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1782, Unknown=1, NotChecked=0, Total=1980 [2024-11-20 22:17:52,588 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 12 Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 45 states have internal predecessors, (95), 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) [2024-11-20 22:17:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:17:54,099 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-20 22:17:54,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 101 transitions. [2024-11-20 22:17:54,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:54,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 84 states and 95 transitions. [2024-11-20 22:17:54,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:17:54,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:17:54,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-11-20 22:17:54,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:17:54,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-20 22:17:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-11-20 22:17:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 46. [2024-11-20 22:17:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-11-20 22:17:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-20 22:17:54,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-20 22:17:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-20 22:17:54,103 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-20 22:17:54,103 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-20 22:17:54,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 52 transitions. [2024-11-20 22:17:54,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:17:54,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:17:54,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:17:54,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:17:54,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:17:54,104 INFO L745 eck$LassoCheckResult]: Stem: 3503#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3505#L367 assume !(main_~length~0#1 < 1); 3500#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3501#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3490#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3491#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3492#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3493#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3502#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3521#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3520#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3515#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3514#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 3507#L371-4 main_~j~0#1 := 0; 3508#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3509#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3534#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3533#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3510#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3498#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3499#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3506#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3535#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3494#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3495#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3532#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3531#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3530#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3529#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3528#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3527#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3526#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3525#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3524#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3523#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3522#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3518#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3519#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3516#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3513#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3511#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3496#L375-3 [2024-11-20 22:17:54,104 INFO L747 eck$LassoCheckResult]: Loop: 3496#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3497#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3496#L375-3 [2024-11-20 22:17:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:17:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1005848136, now seen corresponding path program 10 times [2024-11-20 22:17:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:17:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777602020] [2024-11-20 22:17:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:17:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:17:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:17:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 22:17:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:17:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777602020] [2024-11-20 22:17:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777602020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:17:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562903276] [2024-11-20 22:17:54,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 22:17:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:17:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:17:54,863 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:17:54,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-20 22:17:54,926 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 22:17:54,926 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:17:54,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 22:17:54,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:17:54,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:17:54,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-20 22:17:55,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-20 22:17:55,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 48 [2024-11-20 22:17:55,328 INFO L349 Elim1Store]: treesize reduction 102, result has 25.5 percent of original size [2024-11-20 22:17:55,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 51 [2024-11-20 22:17:55,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2024-11-20 22:17:55,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2024-11-20 22:17:55,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2024-11-20 22:17:55,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 51 [2024-11-20 22:17:55,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 51 [2024-11-20 22:17:55,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:17:55,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 18 [2024-11-20 22:17:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 7 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:17:55,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:18:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 83 refuted. 1 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 22:18:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562903276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:18:22,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:18:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 17] total 46 [2024-11-20 22:18:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270663862] [2024-11-20 22:18:22,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:18:22,365 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:18:22,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 12 times [2024-11-20 22:18:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:22,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167317854] [2024-11-20 22:18:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:22,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:22,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:22,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:18:22,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-20 22:18:22,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1866, Unknown=8, NotChecked=0, Total=2070 [2024-11-20 22:18:22,411 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. cyclomatic complexity: 12 Second operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 46 states have internal predecessors, (95), 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) [2024-11-20 22:18:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:18:23,573 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-20 22:18:23,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 96 transitions. [2024-11-20 22:18:23,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:18:23,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 94 transitions. [2024-11-20 22:18:23,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:18:23,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:18:23,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 94 transitions. [2024-11-20 22:18:23,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:23,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-11-20 22:18:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 94 transitions. [2024-11-20 22:18:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 48. [2024-11-20 22:18:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.125) internal successors, (54), 47 states have internal predecessors, (54), 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) [2024-11-20 22:18:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-20 22:18:23,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-20 22:18:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-20 22:18:23,577 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-20 22:18:23,577 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-20 22:18:23,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2024-11-20 22:18:23,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:18:23,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:23,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:23,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:18:23,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:18:23,578 INFO L745 eck$LassoCheckResult]: Stem: 3961#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3962#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3963#L367 assume !(main_~length~0#1 < 1); 3959#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3960#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 3949#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3950#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3951#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3952#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3977#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3976#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3975#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 3973#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 3972#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 3965#L371-4 main_~j~0#1 := 0; 3966#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3967#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3996#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3995#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3968#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3957#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3958#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3964#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3991#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3953#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3954#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3994#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3993#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3992#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3990#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3989#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3988#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3987#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3986#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3985#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3984#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3983#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3982#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3981#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3979#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3980#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3974#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3971#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3969#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 3955#L375-3 [2024-11-20 22:18:23,578 INFO L747 eck$LassoCheckResult]: Loop: 3955#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3956#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 3955#L375-3 [2024-11-20 22:18:23,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash -250828899, now seen corresponding path program 11 times [2024-11-20 22:18:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312135493] [2024-11-20 22:18:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:23,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:23,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 13 times [2024-11-20 22:18:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019786562] [2024-11-20 22:18:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:23,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:23,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -528402046, now seen corresponding path program 12 times [2024-11-20 22:18:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:23,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136245821] [2024-11-20 22:18:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:23,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:23,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:29,421 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 247 DAG size of output: 185 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-20 22:18:29,612 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:18:29,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:18:29,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:18:29,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:18:29,612 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:18:29,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:29,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:18:29,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:18:29,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration16_Lasso [2024-11-20 22:18:29,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:18:29,613 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:18:29,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:29,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:18:30,166 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:18:30,166 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:18:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,170 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-20 22:18:30,174 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 [2024-11-20 22:18:30,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:30,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:30,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:30,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,196 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-20 22:18:30,198 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 [2024-11-20 22:18:30,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:30,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:30,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:30,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,217 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-20 22:18:30,219 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 [2024-11-20 22:18:30,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:18:30,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:18:30,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:18:30,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,238 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-20 22:18:30,240 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 [2024-11-20 22:18:30,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,261 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-20 22:18:30,263 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 [2024-11-20 22:18:30,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,292 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-20 22:18:30,293 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 [2024-11-20 22:18:30,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-20 22:18:30,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,317 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-20 22:18:30,319 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 [2024-11-20 22:18:30,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,340 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-20 22:18:30,342 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 [2024-11-20 22:18:30,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,366 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-20 22:18:30,368 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 [2024-11-20 22:18:30,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,389 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-20 22:18:30,391 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 [2024-11-20 22:18:30,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,413 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-20 22:18:30,414 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 [2024-11-20 22:18:30,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-11-20 22:18:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,451 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-20 22:18:30,453 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 [2024-11-20 22:18:30,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:18:30,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,476 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-20 22:18:30,478 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 [2024-11-20 22:18:30,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:18:30,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:18:30,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:18:30,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:18:30,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:18:30,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:18:30,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:18:30,506 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-20 22:18:30,506 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-20 22:18:30,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:18:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:30,511 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:18:30,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-20 22:18:30,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:18:30,524 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:18:30,524 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:18:30,524 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1 Supporting invariants [] [2024-11-20 22:18:30,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:30,566 INFO L156 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2024-11-20 22:18:30,567 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-20 22:18:30,568 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-20 22:18:30,568 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-11-20 22:18:30,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:30,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 22:18:30,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:30,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:18:30,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:18:30,880 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-20 22:18:30,881 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-11-20 22:18:30,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 48 states and 54 transitions. Complement of second has 5 states. [2024-11-20 22:18:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:18:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-11-20 22:18:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:18:30,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-20 22:18:30,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:30,939 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:18:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:30,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 22:18:30,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:31,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:18:31,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:18:31,230 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-20 22:18:31,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-11-20 22:18:31,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 48 states and 54 transitions. Complement of second has 5 states. [2024-11-20 22:18:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-20 22:18:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-11-20 22:18:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-11-20 22:18:31,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-20 22:18:31,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:31,295 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:18:31,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:31,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 22:18:31,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:31,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:18:31,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:18:31,623 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-11-20 22:18:31,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-11-20 22:18:31,779 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 12. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 62 states and 71 transitions. Complement of second has 17 states. [2024-11-20 22:18:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-20 22:18:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2024-11-20 22:18:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2024-11-20 22:18:31,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 44 letters. Loop has 2 letters. [2024-11-20 22:18:31,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:31,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 46 letters. Loop has 2 letters. [2024-11-20 22:18:31,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:31,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 44 letters. Loop has 4 letters. [2024-11-20 22:18:31,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:18:31,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2024-11-20 22:18:31,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:18:31,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 64 transitions. [2024-11-20 22:18:31,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-20 22:18:31,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-20 22:18:31,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 64 transitions. [2024-11-20 22:18:31,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:31,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-20 22:18:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 64 transitions. [2024-11-20 22:18:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-20 22:18:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 52 states have internal predecessors, (60), 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) [2024-11-20 22:18:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-11-20 22:18:31,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-20 22:18:31,787 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-20 22:18:31,787 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-20 22:18:31,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2024-11-20 22:18:31,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:18:31,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:31,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:31,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:18:31,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:18:31,791 INFO L745 eck$LassoCheckResult]: Stem: 4726#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 4728#L367 assume !(main_~length~0#1 < 1); 4719#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 4720#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 4713#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4714#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4715#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4716#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4725#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4736#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4735#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 4734#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 4733#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 4730#L371-4 main_~j~0#1 := 0; 4731#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4732#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4765#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4717#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4718#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4723#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4724#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4729#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4764#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4763#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4762#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4761#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4760#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4759#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4758#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4757#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4756#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4755#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4754#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4753#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4752#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4751#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4750#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4749#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4748#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4747#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4746#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4745#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4742#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4743#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4740#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 4739#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 4737#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 4721#L375-3 [2024-11-20 22:18:31,791 INFO L747 eck$LassoCheckResult]: Loop: 4721#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4722#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 4721#L375-3 [2024-11-20 22:18:31,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash -988225614, now seen corresponding path program 13 times [2024-11-20 22:18:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911236218] [2024-11-20 22:18:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:31,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:31,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-20 22:18:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 86 proven. 45 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-20 22:18:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:18:32,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911236218] [2024-11-20 22:18:32,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911236218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:18:32,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922702497] [2024-11-20 22:18:32,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-20 22:18:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:18:32,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:32,110 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:18:32,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-11-20 22:18:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:32,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 22:18:32,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-20 22:18:32,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:18:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-20 22:18:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922702497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:18:32,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:18:32,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2024-11-20 22:18:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680487747] [2024-11-20 22:18:32,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:18:32,632 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:18:32,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 14 times [2024-11-20 22:18:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513146281] [2024-11-20 22:18:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:32,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:32,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:18:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 22:18:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-11-20 22:18:32,667 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. cyclomatic complexity: 14 Second operand has 22 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 22 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) [2024-11-20 22:18:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:18:32,771 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-11-20 22:18:32,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 102 transitions. [2024-11-20 22:18:32,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:18:32,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 56 states and 63 transitions. [2024-11-20 22:18:32,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:18:32,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:18:32,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 63 transitions. [2024-11-20 22:18:32,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:18:32,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-20 22:18:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 63 transitions. [2024-11-20 22:18:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-20 22:18:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 54 states have internal predecessors, (62), 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) [2024-11-20 22:18:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-20 22:18:32,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-20 22:18:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 22:18:32,775 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-20 22:18:32,776 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-20 22:18:32,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 62 transitions. [2024-11-20 22:18:32,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:18:32,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:18:32,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:18:32,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:18:32,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:18:32,776 INFO L745 eck$LassoCheckResult]: Stem: 5176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 5178#L367 assume !(main_~length~0#1 < 1); 5174#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5175#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 5166#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5167#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5168#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5169#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5193#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5192#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5191#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5190#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5189#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5187#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5186#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 5180#L371-4 main_~j~0#1 := 0; 5181#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5182#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5216#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5164#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5165#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5172#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5173#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5179#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5218#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5217#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5215#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5214#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5213#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5212#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5211#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5210#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5209#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5208#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5207#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5206#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5205#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5204#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5203#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5202#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5201#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5200#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5199#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5198#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5196#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5194#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5188#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5185#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5183#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5170#L375-3 [2024-11-20 22:18:32,777 INFO L747 eck$LassoCheckResult]: Loop: 5170#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5171#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5170#L375-3 [2024-11-20 22:18:32,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1555688944, now seen corresponding path program 14 times [2024-11-20 22:18:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662955679] [2024-11-20 22:18:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:18:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 9 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-20 22:18:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:18:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662955679] [2024-11-20 22:18:33,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662955679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:18:33,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105491037] [2024-11-20 22:18:33,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 22:18:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:18:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:18:33,637 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:18:33,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2024-11-20 22:18:33,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 22:18:33,715 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:18:33,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-20 22:18:33,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:18:33,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:18:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 22:18:33,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:33,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-11-20 22:18:33,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:33,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2024-11-20 22:18:34,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 54 [2024-11-20 22:18:34,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-11-20 22:18:34,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 59 [2024-11-20 22:18:34,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 59 [2024-11-20 22:18:34,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 59 [2024-11-20 22:18:34,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-11-20 22:18:34,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:34,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-11-20 22:18:35,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:35,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 57 [2024-11-20 22:18:35,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:18:35,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 21 [2024-11-20 22:18:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 9 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:18:35,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:18:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 9 proven. 131 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-20 22:18:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105491037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:18:57,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:18:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 18] total 57 [2024-11-20 22:18:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467770146] [2024-11-20 22:18:57,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:18:57,291 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:18:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:18:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 15 times [2024-11-20 22:18:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:18:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947804924] [2024-11-20 22:18:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:18:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:18:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:57,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:18:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:18:57,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:18:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:18:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-20 22:18:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2918, Unknown=3, NotChecked=0, Total=3192 [2024-11-20 22:18:57,329 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. cyclomatic complexity: 14 Second operand has 57 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 57 states have internal predecessors, (121), 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) [2024-11-20 22:19:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:19:00,337 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2024-11-20 22:19:00,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 134 transitions. [2024-11-20 22:19:00,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:19:00,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 114 states and 128 transitions. [2024-11-20 22:19:00,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:19:00,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:19:00,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 128 transitions. [2024-11-20 22:19:00,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:19:00,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 114 states and 128 transitions. [2024-11-20 22:19:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 128 transitions. [2024-11-20 22:19:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2024-11-20 22:19:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 57 states have internal predecessors, (65), 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) [2024-11-20 22:19:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-20 22:19:00,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-20 22:19:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-20 22:19:00,341 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-20 22:19:00,341 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-20 22:19:00,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 65 transitions. [2024-11-20 22:19:00,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-20 22:19:00,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:19:00,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:19:00,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 8, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:19:00,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:19:00,343 INFO L745 eck$LassoCheckResult]: Stem: 5780#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5781#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~mem207#1, main_#t~post208#1, main_#t~mem209#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 5782#L367 assume !(main_~length~0#1 < 1); 5777#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5778#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);call write~int#0(0, main_~arr~0#1.base, main_~arr~0#1.offset, 4);main_~i~0#1 := 1; 5769#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5770#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5771#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5772#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5779#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5800#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5799#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5798#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5797#L371-3 assume !!(main_~i~0#1 < main_~length~0#1);call main_#t~mem207#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (main_~i~0#1 - 1), 4);call write~int#0(1 + main_#t~mem207#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem207#1; 5792#L371-2 main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1; 5791#L371-3 assume !(main_~i~0#1 < main_~length~0#1); 5784#L371-4 main_~j~0#1 := 0; 5785#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5786#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5823#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5822#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5787#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5775#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5776#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5783#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5824#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5767#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5768#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5821#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5820#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5819#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5818#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5817#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5816#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5815#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5814#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5813#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5812#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5811#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5810#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5809#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5808#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5807#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5806#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5805#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5804#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5803#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5802#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5801#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5795#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5796#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5793#L375-1 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 5790#L374-2 main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 5788#L374-3 assume !!(main_~j~0#1 < main_~length~0#1); 5773#L375-3 [2024-11-20 22:19:00,343 INFO L747 eck$LassoCheckResult]: Loop: 5773#L375-3 call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5774#L375-1 assume !!(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;call main_#t~mem210#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post211#1 := main_#t~mem210#1;call write~int#0(main_#t~post211#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem210#1;havoc main_#t~post211#1; 5773#L375-3 [2024-11-20 22:19:00,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:19:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash -868054918, now seen corresponding path program 15 times [2024-11-20 22:19:00,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:19:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932833304] [2024-11-20 22:19:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:19:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:19:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:19:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 9 proven. 179 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-20 22:19:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:19:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932833304] [2024-11-20 22:19:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932833304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:19:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096116716] [2024-11-20 22:19:01,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:19:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:19:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:19:01,380 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:19:01,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-11-20 22:19:01,575 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-20 22:19:01,576 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:19:01,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-20 22:19:01,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:19:01,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 22:19:01,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-20 22:19:01,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-20 22:19:01,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:19:01,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-20 22:19:01,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:19:01,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 52 [2024-11-20 22:19:02,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:19:02,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 55 [2024-11-20 22:19:02,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 22:19:02,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 55 [2024-11-20 22:19:02,637 INFO L349 Elim1Store]: treesize reduction 70, result has 57.8 percent of original size [2024-11-20 22:19:02,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 69 treesize of output 126 [2024-11-20 22:19:03,218 INFO L349 Elim1Store]: treesize reduction 94, result has 43.4 percent of original size [2024-11-20 22:19:03,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 226 treesize of output 189 [2024-11-20 22:19:04,055 INFO L349 Elim1Store]: treesize reduction 106, result has 36.1 percent of original size [2024-11-20 22:19:04,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 148 treesize of output 129 [2024-11-20 22:19:04,469 INFO L349 Elim1Store]: treesize reduction 106, result has 36.1 percent of original size [2024-11-20 22:19:04,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 262 treesize of output 183 [2024-11-20 22:19:04,930 INFO L349 Elim1Store]: treesize reduction 106, result has 36.1 percent of original size [2024-11-20 22:19:04,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 264 treesize of output 185