./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-10 07:09:03,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:09:03,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:09:03,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:09:03,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:09:03,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:09:03,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:09:03,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:09:03,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:09:03,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:09:03,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:09:03,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:09:03,303 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:09:03,303 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:09:03,303 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:09:03,303 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:09:03,303 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:09:03,304 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:09:03,304 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:09:03,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:09:03,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:09:03,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:09:03,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:09:03,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:09:03,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:09:03,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:09:03,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:09:03,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:09:03,306 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:09:03,306 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 [2025-01-10 07:09:03,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:09:03,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:09:03,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:09:03,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:09:03,614 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:09:03,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2025-01-10 07:09:04,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9496e9686/906d6c8c8eb0479489fbafbeea263072/FLAG9e0c6c5e8 [2025-01-10 07:09:05,172 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:09:05,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2025-01-10 07:09:05,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9496e9686/906d6c8c8eb0479489fbafbeea263072/FLAG9e0c6c5e8 [2025-01-10 07:09:05,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9496e9686/906d6c8c8eb0479489fbafbeea263072 [2025-01-10 07:09:05,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:09:05,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:09:05,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:09:05,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:09:05,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:09:05,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ff7ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05, skipping insertion in model container [2025-01-10 07:09:05,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:09:05,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:09:05,695 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:09:05,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:09:05,778 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:09:05,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05 WrapperNode [2025-01-10 07:09:05,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:09:05,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:09:05,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:09:05,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:09:05,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,817 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-01-10 07:09:05,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:09:05,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:09:05,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:09:05,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:09:05,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,845 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]. [2025-01-10 07:09:05,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:09:05,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:09:05,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:09:05,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:09:05,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (1/1) ... [2025-01-10 07:09:05,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:05,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:05,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:09:05,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:09:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:09:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:09:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:09:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:09:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:09:06,002 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:09:06,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:09:06,127 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-10 07:09:06,127 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:09:06,134 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:09:06,136 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:09:06,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:09:06 BoogieIcfgContainer [2025-01-10 07:09:06,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:09:06,137 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:09:06,137 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:09:06,143 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:09:06,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:09:06,143 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:09:05" (1/3) ... [2025-01-10 07:09:06,146 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@557e5a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:09:06, skipping insertion in model container [2025-01-10 07:09:06,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:09:06,146 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:09:05" (2/3) ... [2025-01-10 07:09:06,147 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@557e5a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:09:06, skipping insertion in model container [2025-01-10 07:09:06,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:09:06,147 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:09:06" (3/3) ... [2025-01-10 07:09:06,148 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2025-01-10 07:09:06,199 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:09:06,201 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:09:06,201 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:09:06,202 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:09:06,202 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:09:06,202 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:09:06,202 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:09:06,202 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:09:06,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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) [2025-01-10 07:09:06,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:09:06,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:06,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:06,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:09:06,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:09:06,230 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:09:06,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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) [2025-01-10 07:09:06,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:09:06,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:06,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:06,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:09:06,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:09:06,240 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" [2025-01-10 07:09:06,241 INFO L754 eck$LassoCheckResult]: Loop: "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" [2025-01-10 07:09:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:06,247 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2025-01-10 07:09:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037703693] [2025-01-10 07:09:06,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:06,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:09:06,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:09:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:06,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:09:06,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:09:06,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:06,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:06,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:06,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-01-10 07:09:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272446625] [2025-01-10 07:09:06,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:06,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:09:06,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:09:06,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:06,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:06,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:06,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:09:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:09:06,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:06,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:06,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 889568361, now seen corresponding path program 1 times [2025-01-10 07:09:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831114143] [2025-01-10 07:09:06,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:06,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:06,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:06,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:06,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:06,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:06,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:06,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:06,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:06,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:06,908 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:09:06,909 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:09:06,909 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:09:06,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:09:06,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:09:06,911 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:06,911 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:09:06,911 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:09:06,911 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2025-01-10 07:09:06,911 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:09:06,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:09:06,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:06,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:07,543 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:09:07,547 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:09:07,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:07,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:07,555 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 [2025-01-10 07:09:07,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:09:07,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:07,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:07,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:07,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:07,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:07,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:07,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:07,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:07,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:09:07,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:07,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:07,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:09:07,591 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 [2025-01-10 07:09:07,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:07,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:07,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:07,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:07,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:07,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:07,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:07,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:09:07,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:07,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:07,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:07,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:09:07,637 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 [2025-01-10 07:09:07,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:07,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:07,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:07,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:07,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:07,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:07,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:07,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:07,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:07,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:07,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:07,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:09:07,670 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 [2025-01-10 07:09:07,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:07,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:07,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:07,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:07,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:07,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:07,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:09:07,740 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-01-10 07:09:07,743 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-01-10 07:09:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:07,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:07,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:09:07,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:09:07,771 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-01-10 07:09:07,771 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:09:07,772 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2025-01-10 07:09:07,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:09:07,799 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-01-10 07:09:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:09:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:09:07,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:09:07,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:09:07,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:07,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:07,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:09:07,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:07,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:09:07,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:09:07,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:07,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:07,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:09:07,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:07,920 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:09:07,922 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2025-01-10 07:09:07,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 3 states. [2025-01-10 07:09:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:09:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2025-01-10 07:09:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2025-01-10 07:09:07,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2025-01-10 07:09:07,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:07,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2025-01-10 07:09:07,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:07,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:09:07,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:07,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2025-01-10 07:09:07,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:09:07,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 13 states and 18 transitions. [2025-01-10 07:09:07,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:09:07,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:09:07,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-01-10 07:09:07,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:09:07,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-01-10 07:09:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-01-10 07:09:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-01-10 07:09:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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) [2025-01-10 07:09:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:09:08,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:09:08,012 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:09:08,012 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:09:08,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-01-10 07:09:08,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:09:08,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:08,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:08,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:09:08,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:08,014 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-01-10 07:09:08,014 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume !true;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-01-10 07:09:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 1 times [2025-01-10 07:09:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249558556] [2025-01-10 07:09:08,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:08,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:08,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:08,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:08,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 54041, now seen corresponding path program 1 times [2025-01-10 07:09:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465857244] [2025-01-10 07:09:08,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:08,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:08,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465857244] [2025-01-10 07:09:08,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465857244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:09:08,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:09:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:09:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808023191] [2025-01-10 07:09:08,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:09:08,070 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:09:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:08,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 07:09:08,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 07:09:08,073 INFO L87 Difference]: Start difference. First operand 12 states and 17 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) [2025-01-10 07:09:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:08,076 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2025-01-10 07:09:08,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2025-01-10 07:09:08,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:09:08,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. [2025-01-10 07:09:08,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:09:08,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:09:08,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-01-10 07:09:08,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:09:08,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:09:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-01-10 07:09:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:09:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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) [2025-01-10 07:09:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-10 07:09:08,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:09:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:09:08,079 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:09:08,079 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:09:08,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-01-10 07:09:08,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:09:08,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:08,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:08,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:09:08,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-01-10 07:09:08,081 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" [2025-01-10 07:09:08,081 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" [2025-01-10 07:09:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 889568363, now seen corresponding path program 2 times [2025-01-10 07:09:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893101929] [2025-01-10 07:09:08,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:08,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:08,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:08,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:09:08,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:08,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:08,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:08,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:08,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1666475, now seen corresponding path program 1 times [2025-01-10 07:09:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:08,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160511943] [2025-01-10 07:09:08,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:09:08,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:09:08,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:08,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:09:08,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:09:08,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1984502507, now seen corresponding path program 1 times [2025-01-10 07:09:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:08,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721772654] [2025-01-10 07:09:08,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:08,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:09:08,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:09:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:08,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:09:08,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:09:08,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:08,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:08,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:08,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:09:08,393 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:09:08,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:09:08,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:09:08,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:09:08,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:09:08,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:09:08,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:09:08,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2025-01-10 07:09:08,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:09:08,394 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:09:08,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:08,716 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:09:08,716 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:09:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:09:08,723 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 [2025-01-10 07:09:08,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:08,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:08,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:08,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:09:08,753 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 [2025-01-10 07:09:08,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:08,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:08,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:08,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:08,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,781 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:09:08,784 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 [2025-01-10 07:09:08,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:08,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:08,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:08,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:09:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,809 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:09:08,814 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 [2025-01-10 07:09:08,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:08,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:08,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:08,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:09:08,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:09:08,839 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 [2025-01-10 07:09:08,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:08,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:08,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:08,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:09:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,859 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:09:08,861 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 [2025-01-10 07:09:08,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:08,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:08,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:09:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,891 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:09:08,893 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 [2025-01-10 07:09:08,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:08,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:08,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:08,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:08,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,924 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:09:08,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 [2025-01-10 07:09:08,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:08,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:08,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:08,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:08,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:08,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:08,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:09:08,967 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-01-10 07:09:08,967 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-01-10 07:09:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:08,971 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:08,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:09:08,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:09:08,986 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:09:08,986 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:09:08,986 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, ULTIMATE.start_main_~arr~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2025-01-10 07:09:08,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:09:09,002 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-01-10 07:09:09,003 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:09:09,004 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:09:09,004 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2025-01-10 07:09:09,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:09:09,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:09:09,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:09,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:09:09,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:09:09,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:09:09,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:09,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:09:09,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:09,072 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 [2025-01-10 07:09:09,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2025-01-10 07:09:09,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Result 19 states and 25 transitions. Complement of second has 6 states. [2025-01-10 07:09:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:09:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2025-01-10 07:09:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-01-10 07:09:09,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2025-01-10 07:09:09,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:09,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2025-01-10 07:09:09,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:09,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 8 letters. [2025-01-10 07:09:09,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:09,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2025-01-10 07:09:09,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:09,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2025-01-10 07:09:09,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:09:09,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:09:09,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-01-10 07:09:09,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:09,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-01-10 07:09:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-01-10 07:09:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-01-10 07:09:09,106 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) [2025-01-10 07:09:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2025-01-10 07:09:09,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-01-10 07:09:09,107 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2025-01-10 07:09:09,107 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:09:09,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2025-01-10 07:09:09,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:09,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:09,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:09,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:09,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:09,108 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:09,108 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:09,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815501, now seen corresponding path program 1 times [2025-01-10 07:09:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17919782] [2025-01-10 07:09:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:09:09,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:09:09,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:09:09,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:09:09,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 1 times [2025-01-10 07:09:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266590523] [2025-01-10 07:09:09,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:09,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:09,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:09,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:09,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:09,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1984502573, now seen corresponding path program 1 times [2025-01-10 07:09:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451692853] [2025-01-10 07:09:09,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:09,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:09:09,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:09:09,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:09,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:09,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451692853] [2025-01-10 07:09:09,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451692853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:09:09,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:09:09,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:09:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375667010] [2025-01-10 07:09:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:09:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:09,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:09:09,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:09:09,462 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 1.6666666666666667) 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) [2025-01-10 07:09:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:09,513 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2025-01-10 07:09:09,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2025-01-10 07:09:09,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:09,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 34 transitions. [2025-01-10 07:09:09,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 07:09:09,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 07:09:09,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2025-01-10 07:09:09,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:09,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-01-10 07:09:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2025-01-10 07:09:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2025-01-10 07:09:09,520 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) [2025-01-10 07:09:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-01-10 07:09:09,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-01-10 07:09:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:09:09,522 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-01-10 07:09:09,522 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:09:09,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2025-01-10 07:09:09,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:09,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:09,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:09,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:09,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:09,525 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:09,526 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:09,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1390035549, now seen corresponding path program 2 times [2025-01-10 07:09:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804796008] [2025-01-10 07:09:09,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:09:09,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:09:09,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:09,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804796008] [2025-01-10 07:09:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804796008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761805011] [2025-01-10 07:09:09,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:09,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:09,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 07:09:09,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:09:09,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:09:09,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:09,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:09:09,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:09,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 07:09:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761805011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:09:09,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 07:09:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 07:09:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170492306] [2025-01-10 07:09:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:09:09,701 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:09,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,701 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 2 times [2025-01-10 07:09:09,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127450128] [2025-01-10 07:09:09,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:09,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:09,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:09:09,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:09,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:09,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:09,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:09,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:09:09,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:09:09,750 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 2.75) 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) [2025-01-10 07:09:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:09,776 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-01-10 07:09:09,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2025-01-10 07:09:09,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:09,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 22 transitions. [2025-01-10 07:09:09,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:09:09,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:09:09,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2025-01-10 07:09:09,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:09,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-10 07:09:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2025-01-10 07:09:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-10 07:09:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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) [2025-01-10 07:09:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-10 07:09:09,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-10 07:09:09,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:09:09,779 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-10 07:09:09,779 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:09:09,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2025-01-10 07:09:09,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:09,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:09,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:09,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:09,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:09,780 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:09,780 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2034801341, now seen corresponding path program 1 times [2025-01-10 07:09:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231877709] [2025-01-10 07:09:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:09:09,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:09:09,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:09,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:09:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:09:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:09,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 3 times [2025-01-10 07:09:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708360962] [2025-01-10 07:09:09,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:09,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:09,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:09:09,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:09,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:09,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:09,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:09,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 401693917, now seen corresponding path program 1 times [2025-01-10 07:09:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:09,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790496682] [2025-01-10 07:09:09,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:09:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:09,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:09:09,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:09:09,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:09,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 07:09:09,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:09:09,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:09,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:09,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:10,149 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:09:10,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:09:10,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:09:10,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:09:10,149 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:09:10,149 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,150 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:09:10,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:09:10,150 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2025-01-10 07:09:10,150 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:09:10,150 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:09:10,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:10,476 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:09:10,477 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:09:10,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,480 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:09:10,482 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 [2025-01-10 07:09:10,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:10,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:10,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:10,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:09:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,502 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:09:10,506 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 [2025-01-10 07:09:10,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:10,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:10,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:10,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-01-10 07:09:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:09:10,531 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 [2025-01-10 07:09:10,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:10,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:10,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:10,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:09:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,553 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:09:10,555 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 [2025-01-10 07:09:10,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:09:10,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,578 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:09:10,580 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 [2025-01-10 07:09:10,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:10,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:10,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:10,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,602 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:09:10,604 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 [2025-01-10 07:09:10,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:10,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:10,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:10,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:09:10,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,624 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:09:10,625 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 [2025-01-10 07:09:10,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:09:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,652 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:09:10,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 [2025-01-10 07:09:10,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-01-10 07:09:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,692 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:09:10,694 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 [2025-01-10 07:09:10,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:09:10,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,720 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:09:10,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 [2025-01-10 07:09:10,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:09:10,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,750 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:09:10,754 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 [2025-01-10 07:09:10,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:10,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-01-10 07:09:10,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,778 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:09:10,780 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 [2025-01-10 07:09:10,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:10,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:10,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:10,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:10,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:10,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:10,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:09:10,811 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:09:10,811 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:09:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:10,815 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:10,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:09:10,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:09:10,834 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:09:10,835 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:09:10,835 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 [] [2025-01-10 07:09:10,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-01-10 07:09:10,856 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-01-10 07:09:10,858 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:09:10,858 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:09:10,858 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-01-10 07:09:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:10,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:09:10,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:09:10,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:10,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:10,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:09:10,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:10,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:10,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:10,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:10,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:10,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:10,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:10,987 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-01-10 07:09:10,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2025-01-10 07:09:11,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 22 transitions. Complement of second has 4 states. [2025-01-10 07:09:11,012 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 [2025-01-10 07:09:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2025-01-10 07:09:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:09:11,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 12 letters. Loop has 3 letters. [2025-01-10 07:09:11,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:11,014 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:11,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:09:11,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:09:11,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:11,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:11,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:09:11,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:11,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:11,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:11,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:11,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:11,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:11,151 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2025-01-10 07:09:11,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2025-01-10 07:09:11,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 22 transitions. Complement of second has 4 states. [2025-01-10 07:09:11,183 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 [2025-01-10 07:09:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2025-01-10 07:09:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:09:11,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 12 letters. Loop has 3 letters. [2025-01-10 07:09:11,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:11,184 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:11,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:09:11,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:11,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:09:11,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:09:11,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:11,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:11,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:09:11,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:11,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:11,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:11,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:11,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:11,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:11,317 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 3 loop predicates [2025-01-10 07:09:11,318 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2025-01-10 07:09:11,391 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 43 transitions. Complement of second has 12 states. [2025-01-10 07:09:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2025-01-10 07:09:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2025-01-10 07:09:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2025-01-10 07:09:11,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 12 letters. Loop has 3 letters. [2025-01-10 07:09:11,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:11,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 3 letters. [2025-01-10 07:09:11,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:11,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 12 letters. Loop has 6 letters. [2025-01-10 07:09:11,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:11,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-01-10 07:09:11,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:11,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 33 transitions. [2025-01-10 07:09:11,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:09:11,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:09:11,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2025-01-10 07:09:11,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:11,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-01-10 07:09:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2025-01-10 07:09:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-01-10 07:09:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 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) [2025-01-10 07:09:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-01-10 07:09:11,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-01-10 07:09:11,397 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-01-10 07:09:11,397 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:09:11,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2025-01-10 07:09:11,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:11,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:11,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:11,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:11,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:11,399 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:11,399 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash -432388391, now seen corresponding path program 2 times [2025-01-10 07:09:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707993712] [2025-01-10 07:09:11,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:11,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 07:09:11,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:09:11,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:11,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707993712] [2025-01-10 07:09:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707993712] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235261000] [2025-01-10 07:09:11,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:11,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:11,504 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:11,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-01-10 07:09:11,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 07:09:11,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:09:11,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:11,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:09:11,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:11,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235261000] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:11,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 07:09:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227116718] [2025-01-10 07:09:11,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:11,675 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:11,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 4 times [2025-01-10 07:09:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:11,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206615407] [2025-01-10 07:09:11,676 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:11,680 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:09:11,683 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:11,683 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:09:11,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:11,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:11,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:11,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:11,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:11,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:11,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:11,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 07:09:11,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-10 07:09:11,722 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:11,799 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-01-10 07:09:11,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2025-01-10 07:09:11,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:11,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 25 states and 30 transitions. [2025-01-10 07:09:11,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:09:11,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:09:11,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2025-01-10 07:09:11,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:11,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-01-10 07:09:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2025-01-10 07:09:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-10 07:09:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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) [2025-01-10 07:09:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-01-10 07:09:11,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-01-10 07:09:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 07:09:11,806 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-01-10 07:09:11,808 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:09:11,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2025-01-10 07:09:11,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:11,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:11,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:11,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:11,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:11,809 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:11,812 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:11,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1772118841, now seen corresponding path program 3 times [2025-01-10 07:09:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:11,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314765581] [2025-01-10 07:09:11,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:11,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-01-10 07:09:11,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:09:11,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:09:11,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314765581] [2025-01-10 07:09:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314765581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976083216] [2025-01-10 07:09:12,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:12,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:12,229 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:12,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-01-10 07:09:12,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-01-10 07:09:12,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:09:12,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:09:12,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:12,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:09:12,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:12,312 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 [2025-01-10 07:09:12,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-01-10 07:09:12,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:12,363 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 30 treesize of output 32 [2025-01-10 07:09:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:12,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:12,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976083216] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:12,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:12,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2025-01-10 07:09:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535943248] [2025-01-10 07:09:12,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:12,788 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:12,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 5 times [2025-01-10 07:09:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245677633] [2025-01-10 07:09:12,789 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:09:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:12,794 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:12,796 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:12,796 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:09:12,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:12,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:12,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:12,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:12,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:12,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:12,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:12,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 07:09:12,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-01-10 07:09:12,838 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 9 Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 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) [2025-01-10 07:09:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:13,316 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-01-10 07:09:13,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 61 transitions. [2025-01-10 07:09:13,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:13,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 49 states and 57 transitions. [2025-01-10 07:09:13,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-01-10 07:09:13,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-01-10 07:09:13,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2025-01-10 07:09:13,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:13,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-01-10 07:09:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2025-01-10 07:09:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-01-10 07:09:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 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) [2025-01-10 07:09:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-01-10 07:09:13,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-01-10 07:09:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 07:09:13,325 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-01-10 07:09:13,325 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:09:13,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2025-01-10 07:09:13,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:13,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:13,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:13,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:13,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:13,327 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:13,327 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:13,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -606410477, now seen corresponding path program 2 times [2025-01-10 07:09:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859641631] [2025-01-10 07:09:13,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:13,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 07:09:13,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:09:13,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:13,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:09:13,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:09:13,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:13,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:13,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:13,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 6 times [2025-01-10 07:09:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009298586] [2025-01-10 07:09:13,362 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:09:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:13,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:13,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:13,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:09:13,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:13,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:13,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:13,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:13,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:13,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:13,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -942045427, now seen corresponding path program 3 times [2025-01-10 07:09:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:13,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668405386] [2025-01-10 07:09:13,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:13,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:13,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 4 equivalence classes. [2025-01-10 07:09:13,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:09:13,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:09:13,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:13,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:13,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:09:13,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:09:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:13,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:13,945 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:09:13,945 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:09:13,945 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:09:13,945 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:09:13,945 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:09:13,945 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:13,946 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:09:13,946 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:09:13,946 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2025-01-10 07:09:13,946 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:09:13,946 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:09:13,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:14,389 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:09:14,389 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:09:14,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,392 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 07:09:14,394 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 [2025-01-10 07:09:14,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:14,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-01-10 07:09:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,422 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 07:09:14,425 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 [2025-01-10 07:09:14,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:14,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-01-10 07:09:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,451 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 07:09:14,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 [2025-01-10 07:09:14,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:14,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-01-10 07:09:14,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,488 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 07:09:14,492 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 [2025-01-10 07:09:14,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:14,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-01-10 07:09:14,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,518 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 07:09:14,520 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 [2025-01-10 07:09:14,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:14,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:09:14,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,544 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 07:09:14,546 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 [2025-01-10 07:09:14,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:14,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-01-10 07:09:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,569 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 07:09:14,571 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 [2025-01-10 07:09:14,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:14,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:14,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:14,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:14,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:14,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:14,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:09:14,598 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:09:14,598 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-01-10 07:09:14,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:14,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:14,600 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:14,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-01-10 07:09:14,602 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:09:14,612 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:09:14,613 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:09:14,613 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 [] [2025-01-10 07:09:14,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-01-10 07:09:14,637 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-01-10 07:09:14,638 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:09:14,638 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:09:14,639 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-01-10 07:09:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:14,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:09:14,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:09:14,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:14,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:14,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:09:14,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:14,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:14,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:14,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:14,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:14,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:14,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:14,843 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2025-01-10 07:09:14,843 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 13 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) [2025-01-10 07:09:14,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 13. 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 41 states and 49 transitions. Complement of second has 5 states. [2025-01-10 07:09:14,876 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 [2025-01-10 07:09:14,876 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) [2025-01-10 07:09:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-01-10 07:09:14,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 3 letters. [2025-01-10 07:09:14,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:14,877 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:14,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:09:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:09:14,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:14,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:14,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:09:14,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:15,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:15,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:15,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:15,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:15,092 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2025-01-10 07:09:15,092 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2025-01-10 07:09:15,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 41 states and 49 transitions. Complement of second has 5 states. [2025-01-10 07:09:15,131 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 [2025-01-10 07:09:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2025-01-10 07:09:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-01-10 07:09:15,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 3 letters. [2025-01-10 07:09:15,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:15,132 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:15,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:09:15,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:09:15,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:15,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:15,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:09:15,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:15,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:15,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:15,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:15,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:15,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:15,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:15,314 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2025-01-10 07:09:15,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2025-01-10 07:09:15,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 60 states and 72 transitions. Complement of second has 15 states. [2025-01-10 07:09:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 3 non-accepting loop states 2 accepting loop states [2025-01-10 07:09:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2025-01-10 07:09:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2025-01-10 07:09:15,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 38 transitions. Stem has 20 letters. Loop has 3 letters. [2025-01-10 07:09:15,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:15,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 38 transitions. Stem has 23 letters. Loop has 3 letters. [2025-01-10 07:09:15,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:15,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 38 transitions. Stem has 20 letters. Loop has 6 letters. [2025-01-10 07:09:15,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:15,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2025-01-10 07:09:15,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:15,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 51 states and 59 transitions. [2025-01-10 07:09:15,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 07:09:15,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 07:09:15,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 59 transitions. [2025-01-10 07:09:15,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:15,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-10 07:09:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 59 transitions. [2025-01-10 07:09:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-01-10 07:09:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 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) [2025-01-10 07:09:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-01-10 07:09:15,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-10 07:09:15,452 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-10 07:09:15,452 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:09:15,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2025-01-10 07:09:15,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:15,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:15,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:15,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:15,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:15,453 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:15,454 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash 109780745, now seen corresponding path program 4 times [2025-01-10 07:09:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732256433] [2025-01-10 07:09:15,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:15,460 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 07:09:15,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-01-10 07:09:15,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:09:15,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:15,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-01-10 07:09:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:09:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732256433] [2025-01-10 07:09:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732256433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557803688] [2025-01-10 07:09:15,963 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:15,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:15,966 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:15,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-01-10 07:09:16,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 07:09:16,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-01-10 07:09:16,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:09:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:16,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 07:09:16,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:16,022 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 [2025-01-10 07:09:16,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-01-10 07:09:16,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:16,059 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 30 treesize of output 32 [2025-01-10 07:09:16,114 INFO L349 Elim1Store]: treesize reduction 82, result has 24.1 percent of original size [2025-01-10 07:09:16,114 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 9 case distinctions, treesize of input 52 treesize of output 60 [2025-01-10 07:09:16,412 INFO L349 Elim1Store]: treesize reduction 101, result has 19.2 percent of original size [2025-01-10 07:09:16,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 67 treesize of output 54 [2025-01-10 07:09:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:16,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:09:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557803688] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:16,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 25 [2025-01-10 07:09:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492284832] [2025-01-10 07:09:16,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:16,835 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:16,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 7 times [2025-01-10 07:09:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343532548] [2025-01-10 07:09:16,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:09:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:16,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:16,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:16,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:16,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:16,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:16,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:16,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:16,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:16,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:16,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:16,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 07:09:16,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-01-10 07:09:16,877 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 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) [2025-01-10 07:09:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:17,959 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2025-01-10 07:09:17,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 97 transitions. [2025-01-10 07:09:17,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:17,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 82 states and 92 transitions. [2025-01-10 07:09:17,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:09:17,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:09:17,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 92 transitions. [2025-01-10 07:09:17,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:17,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-01-10 07:09:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 92 transitions. [2025-01-10 07:09:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 36. [2025-01-10 07:09:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 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) [2025-01-10 07:09:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-10 07:09:17,965 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-10 07:09:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-10 07:09:17,966 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-10 07:09:17,966 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:09:17,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2025-01-10 07:09:17,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:17,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:17,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:17,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:17,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:17,967 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:17,967 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:17,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1731135593, now seen corresponding path program 5 times [2025-01-10 07:09:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:17,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723483997] [2025-01-10 07:09:17,968 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:09:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:17,974 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 6 equivalence classes. [2025-01-10 07:09:18,001 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:09:18,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 07:09:18,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:18,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723483997] [2025-01-10 07:09:18,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723483997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892619750] [2025-01-10 07:09:18,097 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:09:18,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:18,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:18,099 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:18,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-01-10 07:09:18,142 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 6 equivalence classes. [2025-01-10 07:09:18,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:09:18,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 07:09:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:18,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:18,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:18,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892619750] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:18,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-01-10 07:09:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857680754] [2025-01-10 07:09:18,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:18,335 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:18,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 8 times [2025-01-10 07:09:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963121076] [2025-01-10 07:09:18,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:18,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:18,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:18,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:09:18,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:18,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:18,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:18,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:18,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:18,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:09:18,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:09:18,374 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 11 Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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) [2025-01-10 07:09:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:18,427 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-01-10 07:09:18,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 67 transitions. [2025-01-10 07:09:18,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:18,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 37 states and 43 transitions. [2025-01-10 07:09:18,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:09:18,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:09:18,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2025-01-10 07:09:18,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:18,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-10 07:09:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2025-01-10 07:09:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 07:09:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 36 states have internal predecessors, (43), 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) [2025-01-10 07:09:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-10 07:09:18,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-10 07:09:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 07:09:18,431 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-10 07:09:18,431 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:09:18,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2025-01-10 07:09:18,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:18,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:18,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:18,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:18,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:18,433 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:18,433 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1308885815, now seen corresponding path program 6 times [2025-01-10 07:09:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013881821] [2025-01-10 07:09:18,434 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:09:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:18,440 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 6 equivalence classes. [2025-01-10 07:09:18,458 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:09:18,458 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 07:09:18,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:09:18,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:09:18,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:18,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 9 times [2025-01-10 07:09:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265318238] [2025-01-10 07:09:18,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:18,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:18,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:18,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:09:18,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:18,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:18,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:18,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:18,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 990793623, now seen corresponding path program 7 times [2025-01-10 07:09:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:18,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982197481] [2025-01-10 07:09:18,484 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:09:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:18,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:09:18,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:09:18,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:18,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:18,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:09:18,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:09:18,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:18,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:18,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:19,488 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:09:19,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:09:19,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:09:19,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:09:19,489 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:09:19,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:19,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:09:19,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:09:19,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2025-01-10 07:09:19,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:09:19,489 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:09:19,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:19,899 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:09:19,899 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:09:19,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:19,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:19,903 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:19,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 07:09:19,906 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 [2025-01-10 07:09:19,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:19,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:19,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:19,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:19,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:19,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:19,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:19,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:19,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-01-10 07:09:19,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:19,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:19,925 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-01-10 07:09:19,928 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 [2025-01-10 07:09:19,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:19,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:19,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:19,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:19,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:19,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:19,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:19,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:19,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-01-10 07:09:19,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:19,956 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:19,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 07:09:19,959 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 [2025-01-10 07:09:19,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:19,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:19,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:19,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:19,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:19,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:19,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:19,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:19,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-01-10 07:09:19,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:19,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:19,983 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 07:09:19,985 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 [2025-01-10 07:09:19,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:19,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:19,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:19,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:19,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:19,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:19,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:19,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-01-10 07:09:20,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,005 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 07:09:20,006 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 [2025-01-10 07:09:20,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:20,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:20,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:20,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 07:09:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,025 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:09:20,028 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 [2025-01-10 07:09:20,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:20,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:20,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:20,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-01-10 07:09:20,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,047 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 07:09:20,048 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 [2025-01-10 07:09:20,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:20,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:20,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:20,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-01-10 07:09:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,067 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 07:09:20,069 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 [2025-01-10 07:09:20,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:20,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:20,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:20,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-01-10 07:09:20,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,088 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 07:09:20,090 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 [2025-01-10 07:09:20,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:20,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:20,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:20,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-01-10 07:09:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,109 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 07:09:20,111 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 [2025-01-10 07:09:20,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:20,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:20,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:20,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,132 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 07:09:20,134 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 [2025-01-10 07:09:20,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:20,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:20,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 07:09:20,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,169 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-01-10 07:09:20,173 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 [2025-01-10 07:09:20,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:20,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:20,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:20,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,199 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 07:09:20,201 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 [2025-01-10 07:09:20,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:20,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:20,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:20,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:20,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:20,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:20,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:09:20,229 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-01-10 07:09:20,229 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:09:20,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:20,232 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:20,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 07:09:20,233 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:09:20,243 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:09:20,243 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:09:20,243 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 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2025-01-10 07:09:20,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 07:09:20,266 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-01-10 07:09:20,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:09:20,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:09:20,268 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-01-10 07:09:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:20,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:09:20,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:09:20,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:20,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:20,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:09:20,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:20,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:20,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:20,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:20,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:20,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:20,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:20,457 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2025-01-10 07:09:20,457 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-01-10 07:09:20,478 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 11. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Result 37 states and 43 transitions. Complement of second has 4 states. [2025-01-10 07:09:20,479 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 [2025-01-10 07:09:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-01-10 07:09:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:09:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 31 letters. Loop has 3 letters. [2025-01-10 07:09:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:20,480 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:20,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:09:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:09:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:20,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:09:20,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:20,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:20,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:20,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:20,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:20,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:20,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2025-01-10 07:09:20,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-01-10 07:09:20,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 11. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Result 37 states and 43 transitions. Complement of second has 4 states. [2025-01-10 07:09:20,700 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 [2025-01-10 07:09:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-01-10 07:09:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:09:20,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 31 letters. Loop has 3 letters. [2025-01-10 07:09:20,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:20,701 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:20,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:09:20,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:09:20,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:20,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:20,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:09:20,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:20,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:20,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:20,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:20,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:20,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:20,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:20,870 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 3 loop predicates [2025-01-10 07:09:20,870 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-01-10 07:09:20,956 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 43 transitions. cyclomatic complexity: 11. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Result 55 states and 64 transitions. Complement of second has 16 states. [2025-01-10 07:09:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 3 non-accepting loop states 2 accepting loop states [2025-01-10 07:09:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-01-10 07:09:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2025-01-10 07:09:20,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 31 letters. Loop has 3 letters. [2025-01-10 07:09:20,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:20,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 34 letters. Loop has 3 letters. [2025-01-10 07:09:20,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:20,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 31 letters. Loop has 6 letters. [2025-01-10 07:09:20,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:20,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2025-01-10 07:09:20,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:20,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 47 states and 54 transitions. [2025-01-10 07:09:20,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:09:20,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:09:20,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 54 transitions. [2025-01-10 07:09:20,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:20,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-01-10 07:09:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 54 transitions. [2025-01-10 07:09:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2025-01-10 07:09:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 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) [2025-01-10 07:09:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-01-10 07:09:20,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-01-10 07:09:20,961 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-01-10 07:09:20,961 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:09:20,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2025-01-10 07:09:20,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:20,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:20,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:20,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:20,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:20,963 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:20,965 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:20,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash 649833311, now seen corresponding path program 8 times [2025-01-10 07:09:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:20,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339569272] [2025-01-10 07:09:20,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:20,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 07:09:20,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:09:20,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:20,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:21,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-01-10 07:09:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339569272] [2025-01-10 07:09:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339569272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865035367] [2025-01-10 07:09:21,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:21,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:21,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:21,142 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:21,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-01-10 07:09:21,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 07:09:21,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 07:09:21,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:21,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:09:21,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:21,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865035367] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:21,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-01-10 07:09:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070955685] [2025-01-10 07:09:21,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:21,437 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 10 times [2025-01-10 07:09:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160296257] [2025-01-10 07:09:21,438 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:21,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:09:21,442 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:21,442 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:09:21,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:21,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:21,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:21,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:21,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:21,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:21,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:21,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 07:09:21,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-01-10 07:09:21,480 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 13 Second operand has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 18 states have internal predecessors, (59), 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) [2025-01-10 07:09:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:21,559 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-01-10 07:09:21,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 82 transitions. [2025-01-10 07:09:21,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:21,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 44 states and 51 transitions. [2025-01-10 07:09:21,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:09:21,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:09:21,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2025-01-10 07:09:21,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:21,560 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-01-10 07:09:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2025-01-10 07:09:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-10 07:09:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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) [2025-01-10 07:09:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-01-10 07:09:21,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-01-10 07:09:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 07:09:21,563 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-01-10 07:09:21,563 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-01-10 07:09:21,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2025-01-10 07:09:21,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:21,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:21,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:21,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:21,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:21,564 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:21,564 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1111985409, now seen corresponding path program 9 times [2025-01-10 07:09:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858519121] [2025-01-10 07:09:21,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:21,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 6 equivalence classes. [2025-01-10 07:09:21,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 07:09:21,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:09:21,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 41 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:22,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858519121] [2025-01-10 07:09:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858519121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451911171] [2025-01-10 07:09:22,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:22,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:22,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:22,465 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:22,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-01-10 07:09:22,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 6 equivalence classes. [2025-01-10 07:09:22,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 07:09:22,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:09:22,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:22,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 07:09:22,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:22,582 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 [2025-01-10 07:09:22,607 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 [2025-01-10 07:09:22,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:22,668 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 26 treesize of output 28 [2025-01-10 07:09:22,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:22,704 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 33 treesize of output 38 [2025-01-10 07:09:22,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:22,753 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 40 treesize of output 48 [2025-01-10 07:09:22,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:22,972 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 51 treesize of output 44 [2025-01-10 07:09:23,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:23,091 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 44 treesize of output 34 [2025-01-10 07:09:23,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:23,145 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 37 treesize of output 31 [2025-01-10 07:09:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:09:23,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 55 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451911171] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:23,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 12] total 38 [2025-01-10 07:09:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598853311] [2025-01-10 07:09:23,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:23,521 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:23,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 11 times [2025-01-10 07:09:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781555699] [2025-01-10 07:09:23,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:09:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:23,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:23,525 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:23,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:09:23,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:23,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:23,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:23,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:23,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:23,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:23,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:23,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:23,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-10 07:09:23,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 07:09:23,559 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 13 Second operand has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 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) [2025-01-10 07:09:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:26,161 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2025-01-10 07:09:26,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 228 transitions. [2025-01-10 07:09:26,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:09:26,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 193 states and 214 transitions. [2025-01-10 07:09:26,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-01-10 07:09:26,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-01-10 07:09:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 214 transitions. [2025-01-10 07:09:26,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:26,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193 states and 214 transitions. [2025-01-10 07:09:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 214 transitions. [2025-01-10 07:09:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 90. [2025-01-10 07:09:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 89 states have internal predecessors, (104), 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) [2025-01-10 07:09:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2025-01-10 07:09:26,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 104 transitions. [2025-01-10 07:09:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-10 07:09:26,168 INFO L432 stractBuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2025-01-10 07:09:26,168 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-01-10 07:09:26,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2025-01-10 07:09:26,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:26,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:26,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:26,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:26,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:26,169 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:26,169 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:26,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 232521791, now seen corresponding path program 10 times [2025-01-10 07:09:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158489373] [2025-01-10 07:09:26,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:26,178 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-10 07:09:26,191 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-01-10 07:09:26,191 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:09:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 7 proven. 92 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158489373] [2025-01-10 07:09:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158489373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815705686] [2025-01-10 07:09:26,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:26,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:26,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:26,961 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:26,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-01-10 07:09:27,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-10 07:09:27,039 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-01-10 07:09:27,039 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:09:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:27,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 07:09:27,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:27,048 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 [2025-01-10 07:09:27,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-01-10 07:09:27,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:27,127 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 30 treesize of output 32 [2025-01-10 07:09:27,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:27,164 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 39 treesize of output 44 [2025-01-10 07:09:27,240 INFO L349 Elim1Store]: treesize reduction 110, result has 24.1 percent of original size [2025-01-10 07:09:27,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 61 treesize of output 72 [2025-01-10 07:09:27,565 INFO L349 Elim1Store]: treesize reduction 117, result has 17.0 percent of original size [2025-01-10 07:09:27,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 76 treesize of output 66 [2025-01-10 07:09:27,801 INFO L349 Elim1Store]: treesize reduction 101, result has 19.2 percent of original size [2025-01-10 07:09:27,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 67 treesize of output 54 [2025-01-10 07:09:27,879 INFO L349 Elim1Store]: treesize reduction 85, result has 22.0 percent of original size [2025-01-10 07:09:27,879 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 8 case distinctions, treesize of input 58 treesize of output 51 [2025-01-10 07:09:28,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 07:09:28,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 07:09:28,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 07:09:28,039 INFO L349 Elim1Store]: treesize reduction 23, result has 52.1 percent of original size [2025-01-10 07:09:28,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2025-01-10 07:09:28,217 INFO L349 Elim1Store]: treesize reduction 77, result has 38.4 percent of original size [2025-01-10 07:09:28,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 93 treesize of output 98 [2025-01-10 07:09:28,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:28,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 75 [2025-01-10 07:09:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 7 proven. 99 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:09:28,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 7 proven. 92 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815705686] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:28,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 32 [2025-01-10 07:09:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88679631] [2025-01-10 07:09:28,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:28,867 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:28,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 12 times [2025-01-10 07:09:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244138166] [2025-01-10 07:09:28,868 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:09:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:28,870 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:28,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:28,872 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:09:28,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:28,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:28,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:28,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:28,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:28,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:28,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 07:09:28,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-01-10 07:09:28,910 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 24 Second operand has 32 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 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) [2025-01-10 07:09:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:29,504 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2025-01-10 07:09:29,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 124 transitions. [2025-01-10 07:09:29,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:29,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 108 states and 122 transitions. [2025-01-10 07:09:29,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:09:29,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-01-10 07:09:29,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 122 transitions. [2025-01-10 07:09:29,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:29,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 122 transitions. [2025-01-10 07:09:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 122 transitions. [2025-01-10 07:09:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2025-01-10 07:09:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 95 states have internal predecessors, (110), 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) [2025-01-10 07:09:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2025-01-10 07:09:29,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-01-10 07:09:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 07:09:29,512 INFO L432 stractBuchiCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-01-10 07:09:29,512 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-01-10 07:09:29,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 110 transitions. [2025-01-10 07:09:29,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:29,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:29,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:29,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:29,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:29,515 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:29,515 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:29,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash -786373043, now seen corresponding path program 11 times [2025-01-10 07:09:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:29,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307818694] [2025-01-10 07:09:29,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:09:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:29,523 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-01-10 07:09:29,547 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:09:29,548 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-01-10 07:09:29,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:29,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:29,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 07:09:29,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:09:29,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:29,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:29,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 13 times [2025-01-10 07:09:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:29,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418464733] [2025-01-10 07:09:29,566 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:09:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:29,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:29,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:29,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:29,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:29,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:29,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:29,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:29,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:29,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:29,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:29,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2087663725, now seen corresponding path program 12 times [2025-01-10 07:09:29,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:29,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934655030] [2025-01-10 07:09:29,578 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:09:29,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:29,587 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 7 equivalence classes. [2025-01-10 07:09:29,638 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 07:09:29,638 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-10 07:09:29,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:29,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:29,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 07:09:29,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 07:09:29,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:29,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:29,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:37,140 WARN L286 SmtUtils]: Spent 7.45s on a formula simplification. DAG size of input: 247 DAG size of output: 188 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:09:37,491 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:09:37,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:09:37,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:09:37,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:09:37,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:09:37,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:37,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:09:37,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:09:37,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration16_Lasso [2025-01-10 07:09:37,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:09:37,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:09:37,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:37,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:38,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:38,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:09:38,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:09:38,218 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:09:38,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,221 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-01-10 07:09:38,223 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 [2025-01-10 07:09:38,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,242 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 07:09:38,244 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 [2025-01-10 07:09:38,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:38,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,268 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 07:09:38,270 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 [2025-01-10 07:09:38,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-01-10 07:09:38,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,295 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 07:09:38,299 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 [2025-01-10 07:09:38,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,325 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 07:09:38,330 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 [2025-01-10 07:09:38,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-01-10 07:09:38,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,355 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 07:09:38,359 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 [2025-01-10 07:09:38,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-01-10 07:09:38,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,383 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 07:09:38,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:09:38,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-01-10 07:09:38,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,414 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 07:09:38,416 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 [2025-01-10 07:09:38,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:09:38,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:09:38,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:09:38,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-01-10 07:09:38,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,435 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-01-10 07:09:38,436 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 [2025-01-10 07:09:38,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-01-10 07:09:38,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,458 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-01-10 07:09:38,460 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 [2025-01-10 07:09:38,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-01-10 07:09:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,483 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-01-10 07:09:38,485 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 [2025-01-10 07:09:38,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-01-10 07:09:38,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,505 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-01-10 07:09:38,507 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 [2025-01-10 07:09:38,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-01-10 07:09:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,528 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-01-10 07:09:38,530 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 [2025-01-10 07:09:38,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-01-10 07:09:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,554 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-01-10 07:09:38,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 [2025-01-10 07:09:38,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:09:38,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-01-10 07:09:38,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,577 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-01-10 07:09:38,578 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 [2025-01-10 07:09:38,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:09:38,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:09:38,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:09:38,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:09:38,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:09:38,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:09:38,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:09:38,606 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-01-10 07:09:38,606 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:09:38,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:09:38,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:38,609 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:09:38,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-01-10 07:09:38,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:09:38,620 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:09:38,620 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:09:38,620 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 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2025-01-10 07:09:38,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-01-10 07:09:38,662 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-01-10 07:09:38,663 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:09:38,663 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:09:38,663 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-01-10 07:09:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:38,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 07:09:38,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:09:38,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:38,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:09:38,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:38,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:38,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:38,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:38,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:38,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:38,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:38,886 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2025-01-10 07:09:38,886 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 110 transitions. cyclomatic complexity: 24 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:38,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 110 transitions. cyclomatic complexity: 24. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 110 transitions. Complement of second has 4 states. [2025-01-10 07:09:38,909 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 [2025-01-10 07:09:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:09:38,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 3 letters. [2025-01-10 07:09:38,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:38,911 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:38,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:38,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 07:09:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:09:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:38,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:09:38,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:39,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-01-10 07:09:39,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:39,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:39,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:39,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:39,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:39,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:39,163 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2025-01-10 07:09:39,163 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 110 transitions. cyclomatic complexity: 24 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:39,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 110 transitions. cyclomatic complexity: 24. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 110 transitions. Complement of second has 4 states. [2025-01-10 07:09:39,182 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 [2025-01-10 07:09:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:09:39,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 3 letters. [2025-01-10 07:09:39,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:39,183 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:09:39,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:39,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 07:09:39,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 07:09:39,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:39,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:09:39,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:39,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:39,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:39,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:39,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:39,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:09:39,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:09:39,383 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2025-01-10 07:09:39,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 110 transitions. cyclomatic complexity: 24 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:39,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 110 transitions. cyclomatic complexity: 24. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 125 states and 145 transitions. Complement of second has 18 states. [2025-01-10 07:09:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2025-01-10 07:09:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2025-01-10 07:09:39,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 45 letters. Loop has 3 letters. [2025-01-10 07:09:39,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:39,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 48 letters. Loop has 3 letters. [2025-01-10 07:09:39,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:39,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 45 letters. Loop has 6 letters. [2025-01-10 07:09:39,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:09:39,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 145 transitions. [2025-01-10 07:09:39,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:39,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 113 states and 128 transitions. [2025-01-10 07:09:39,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-01-10 07:09:39,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 07:09:39,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 128 transitions. [2025-01-10 07:09:39,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:39,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 128 transitions. [2025-01-10 07:09:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 128 transitions. [2025-01-10 07:09:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2025-01-10 07:09:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.1415094339622642) internal successors, (121), 105 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) [2025-01-10 07:09:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2025-01-10 07:09:39,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 121 transitions. [2025-01-10 07:09:39,494 INFO L432 stractBuchiCegarLoop]: Abstraction has 106 states and 121 transitions. [2025-01-10 07:09:39,494 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-01-10 07:09:39,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 121 transitions. [2025-01-10 07:09:39,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:39,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:39,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:39,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 7, 7, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:39,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:39,496 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:39,496 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 939131177, now seen corresponding path program 13 times [2025-01-10 07:09:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17378297] [2025-01-10 07:09:39,496 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:09:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:39,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 07:09:39,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 07:09:39,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:39,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 121 proven. 41 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 07:09:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17378297] [2025-01-10 07:09:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17378297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055824003] [2025-01-10 07:09:39,692 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:09:39,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:39,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:39,695 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:39,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-01-10 07:09:39,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 07:09:39,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 07:09:39,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:39,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:39,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:09:39,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 152 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 07:09:39,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 152 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 07:09:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055824003] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:40,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-01-10 07:09:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730399112] [2025-01-10 07:09:40,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:40,130 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 14 times [2025-01-10 07:09:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24622574] [2025-01-10 07:09:40,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:40,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:40,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:40,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:09:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:40,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:40,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:40,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:40,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:40,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:40,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 07:09:40,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-01-10 07:09:40,171 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. cyclomatic complexity: 27 Second operand has 21 states, 20 states have (on average 3.8) internal successors, (76), 21 states have internal predecessors, (76), 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) [2025-01-10 07:09:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:40,284 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-01-10 07:09:40,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 113 transitions. [2025-01-10 07:09:40,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:40,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 59 states and 67 transitions. [2025-01-10 07:09:40,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:09:40,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:09:40,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 67 transitions. [2025-01-10 07:09:40,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:40,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-01-10 07:09:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 67 transitions. [2025-01-10 07:09:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-10 07:09:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:09:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-01-10 07:09:40,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-01-10 07:09:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 07:09:40,290 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-01-10 07:09:40,290 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-01-10 07:09:40,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2025-01-10 07:09:40,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:40,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:40,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:40,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 7, 7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:40,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:40,291 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:40,291 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:40,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 980512137, now seen corresponding path program 14 times [2025-01-10 07:09:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18310633] [2025-01-10 07:09:40,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:40,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-10 07:09:40,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 07:09:40,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:40,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 10 proven. 166 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 07:09:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:09:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18310633] [2025-01-10 07:09:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18310633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:09:41,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115169263] [2025-01-10 07:09:41,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:09:41,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:09:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:09:41,438 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:09:41,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-01-10 07:09:41,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-10 07:09:41,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 07:09:41,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:09:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:09:41,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-10 07:09:41,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:09:41,576 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 [2025-01-10 07:09:41,609 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 [2025-01-10 07:09:41,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:41,646 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 26 treesize of output 28 [2025-01-10 07:09:41,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:41,690 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 33 treesize of output 38 [2025-01-10 07:09:41,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:41,743 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 40 treesize of output 48 [2025-01-10 07:09:41,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:41,817 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 47 treesize of output 58 [2025-01-10 07:09:42,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 54 [2025-01-10 07:09:42,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,261 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 51 treesize of output 44 [2025-01-10 07:09:42,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,326 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 44 treesize of output 41 [2025-01-10 07:09:42,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,446 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 44 treesize of output 34 [2025-01-10 07:09:42,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,499 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 37 treesize of output 31 [2025-01-10 07:09:42,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,530 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 37 treesize of output 31 [2025-01-10 07:09:42,616 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 0 case distinctions, treesize of input 37 treesize of output 24 [2025-01-10 07:09:42,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:09:42,652 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 29 treesize of output 13 [2025-01-10 07:09:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 9 proven. 175 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 07:09:42,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:09:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 9 proven. 160 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 07:09:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115169263] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:09:43,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:09:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 49 [2025-01-10 07:09:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704131774] [2025-01-10 07:09:43,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:09:43,099 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:09:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 15 times [2025-01-10 07:09:43,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403587090] [2025-01-10 07:09:43,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:43,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:43,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:43,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:09:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:43,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:43,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:43,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:43,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:43,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:43,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:09:43,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 07:09:43,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2100, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 07:09:43,140 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 15 Second operand has 49 states, 49 states have (on average 2.489795918367347) internal successors, (122), 49 states have internal predecessors, (122), 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) [2025-01-10 07:09:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:09:45,283 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-01-10 07:09:45,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 111 transitions. [2025-01-10 07:09:45,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:45,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 99 states and 107 transitions. [2025-01-10 07:09:45,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-01-10 07:09:45,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-01-10 07:09:45,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 107 transitions. [2025-01-10 07:09:45,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:09:45,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-01-10 07:09:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 107 transitions. [2025-01-10 07:09:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2025-01-10 07:09:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 80 states have internal predecessors, (89), 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) [2025-01-10 07:09:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-01-10 07:09:45,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-01-10 07:09:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-10 07:09:45,288 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-01-10 07:09:45,288 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-01-10 07:09:45,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 89 transitions. [2025-01-10 07:09:45,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:09:45,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:09:45,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:09:45,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 10, 10, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-01-10 07:09:45,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:09:45,290 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:09:45,290 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:09:45,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1955059965, now seen corresponding path program 15 times [2025-01-10 07:09:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242808863] [2025-01-10 07:09:45,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:09:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:45,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 10 equivalence classes. [2025-01-10 07:09:45,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:09:45,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 07:09:45,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:45,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:09:45,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:09:45,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:45,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:45,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:45,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 16 times [2025-01-10 07:09:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:45,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391622463] [2025-01-10 07:09:45,358 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:45,361 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:09:45,362 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:45,362 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:09:45,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:45,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:45,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:09:45,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:09:45,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:45,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:45,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:09:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:09:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 860111645, now seen corresponding path program 16 times [2025-01-10 07:09:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:09:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316621281] [2025-01-10 07:09:45,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:09:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:09:45,375 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-01-10 07:09:45,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 07:09:45,400 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:09:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:45,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:09:45,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 07:09:45,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 07:09:45,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:09:45,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:09:45,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:07,243 WARN L286 SmtUtils]: Spent 21.76s on a formula simplification. DAG size of input: 319 DAG size of output: 244 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-10 07:10:07,571 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:07,571 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:07,571 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:07,571 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:07,571 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:07,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:07,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:07,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:07,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration19_Lasso [2025-01-10 07:10:07,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:07,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:07,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:07,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:08,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:08,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:08,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:08,258 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:08,258 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:08,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,261 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-01-10 07:10:08,264 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 [2025-01-10 07:10:08,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-01-10 07:10:08,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,285 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-01-10 07:10:08,286 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 [2025-01-10 07:10:08,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-01-10 07:10:08,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,306 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-01-10 07:10:08,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:08,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-01-10 07:10:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,329 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-01-10 07:10:08,331 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 [2025-01-10 07:10:08,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-01-10 07:10:08,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,351 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-01-10 07:10:08,352 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 [2025-01-10 07:10:08,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-01-10 07:10:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,373 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-01-10 07:10:08,375 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 [2025-01-10 07:10:08,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:08,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,396 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-01-10 07:10:08,398 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 [2025-01-10 07:10:08,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:08,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:08,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:08,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-01-10 07:10:08,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,417 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-01-10 07:10:08,419 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 [2025-01-10 07:10:08,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:08,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:08,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:08,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-01-10 07:10:08,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,441 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-01-10 07:10:08,443 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 [2025-01-10 07:10:08,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:08,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:08,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:08,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:08,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:08,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:08,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:08,475 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-01-10 07:10:08,475 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:10:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:08,478 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:08,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-01-10 07:10:08,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:08,494 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:08,494 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:08,494 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1 Supporting invariants [] [2025-01-10 07:10:08,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:08,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-01-10 07:10:08,595 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-01-10 07:10:08,596 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:10:08,597 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:10:08,597 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-01-10 07:10:08,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:08,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:10:08,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:10:08,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:08,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 07:10:08,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:08,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:08,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:08,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:08,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:10:08,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:09,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2025-01-10 07:10:09,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2025-01-10 07:10:09,079 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 81 states and 89 transitions. Complement of second has 5 states. [2025-01-10 07:10:09,079 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 [2025-01-10 07:10:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2025-01-10 07:10:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-01-10 07:10:09,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 62 letters. Loop has 3 letters. [2025-01-10 07:10:09,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:09,080 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:10:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:09,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:10:09,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:10:09,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:09,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:09,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 07:10:09,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:09,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:09,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:09,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:09,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:10:09,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:09,490 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 3 loop predicates [2025-01-10 07:10:09,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2025-01-10 07:10:09,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 81 states and 89 transitions. Complement of second has 5 states. [2025-01-10 07:10:09,530 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 [2025-01-10 07:10:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2025-01-10 07:10:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-01-10 07:10:09,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 62 letters. Loop has 3 letters. [2025-01-10 07:10:09,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:09,531 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:10:09,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:09,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 07:10:09,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 07:10:09,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:09,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:09,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 07:10:09,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:09,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:09,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:09,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:09,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:09,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:10:09,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:09,942 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2025-01-10 07:10:09,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2025-01-10 07:10:10,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 104 states and 115 transitions. Complement of second has 21 states. [2025-01-10 07:10:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 8 stem states 3 non-accepting loop states 2 accepting loop states [2025-01-10 07:10:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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) [2025-01-10 07:10:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2025-01-10 07:10:10,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 62 letters. Loop has 3 letters. [2025-01-10 07:10:10,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:10,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 65 letters. Loop has 3 letters. [2025-01-10 07:10:10,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:10,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 62 letters. Loop has 6 letters. [2025-01-10 07:10:10,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:10,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 115 transitions. [2025-01-10 07:10:10,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:10,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 89 states and 97 transitions. [2025-01-10 07:10:10,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-01-10 07:10:10,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-01-10 07:10:10,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 97 transitions. [2025-01-10 07:10:10,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:10,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 97 transitions. [2025-01-10 07:10:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 97 transitions. [2025-01-10 07:10:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2025-01-10 07:10:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 83 states have internal predecessors, (92), 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) [2025-01-10 07:10:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-01-10 07:10:10,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-01-10 07:10:10,229 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-01-10 07:10:10,229 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-01-10 07:10:10,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 92 transitions. [2025-01-10 07:10:10,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:10,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:10,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:10,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 14, 14, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:10,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:10,231 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:10:10,231 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:10:10,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:10,231 INFO L85 PathProgramCache]: Analyzing trace with hash 493272089, now seen corresponding path program 17 times [2025-01-10 07:10:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:10,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041170013] [2025-01-10 07:10:10,232 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:10,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:10,242 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 14 equivalence classes. [2025-01-10 07:10:10,278 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 07:10:10,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-01-10 07:10:10,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 07:10:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041170013] [2025-01-10 07:10:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041170013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881383121] [2025-01-10 07:10:10,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:10,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:10,525 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:10,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-01-10 07:10:10,616 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 14 equivalence classes. [2025-01-10 07:10:11,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 07:10:11,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-01-10 07:10:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:11,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 07:10:11,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 07:10:11,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 431 proven. 15 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 07:10:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881383121] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:11,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-01-10 07:10:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413054742] [2025-01-10 07:10:11,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:11,518 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:11,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:11,518 INFO L85 PathProgramCache]: Analyzing trace with hash 57695, now seen corresponding path program 17 times [2025-01-10 07:10:11,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376488786] [2025-01-10 07:10:11,518 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:11,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:11,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:11,522 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:11,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:11,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:11,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:11,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:11,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:11,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:11,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 07:10:11,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-01-10 07:10:11,565 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. cyclomatic complexity: 15 Second operand has 22 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 22 states have internal predecessors, (82), 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) [2025-01-10 07:10:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:11,656 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2025-01-10 07:10:11,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 164 transitions. [2025-01-10 07:10:11,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:11,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 85 states and 93 transitions. [2025-01-10 07:10:11,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:10:11,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:10:11,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 93 transitions. [2025-01-10 07:10:11,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:11,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 93 transitions. [2025-01-10 07:10:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 93 transitions. [2025-01-10 07:10:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-10 07:10:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 84 states have internal predecessors, (93), 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) [2025-01-10 07:10:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2025-01-10 07:10:11,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 93 transitions. [2025-01-10 07:10:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 07:10:11,661 INFO L432 stractBuchiCegarLoop]: Abstraction has 85 states and 93 transitions. [2025-01-10 07:10:11,661 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-01-10 07:10:11,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 93 transitions. [2025-01-10 07:10:11,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:10:11,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:11,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:11,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 14, 14, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-01-10 07:10:11,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:11,663 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "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;" "assume !(main_~length~0#1 < 1);" "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;" "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;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "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;main_#t~post208#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post208#1;havoc main_#t~post208#1;" "assume !(main_~i~0#1 < main_~length~0#1);main_~j~0#1 := 0;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1;" "main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1;" "assume main_~j~0#1 < main_~length~0#1;" [2025-01-10 07:10:11,663 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem209#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);" "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;" [2025-01-10 07:10:11,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 446001273, now seen corresponding path program 18 times [2025-01-10 07:10:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:11,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333782659] [2025-01-10 07:10:11,664 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:10:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:11,676 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 14 equivalence classes. [2025-01-10 07:10:11,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 07:10:11,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-01-10 07:10:11,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 174 proven. 311 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-10 07:10:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333782659] [2025-01-10 07:10:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333782659] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865760561] [2025-01-10 07:10:14,918 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:10:14,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:14,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:14,920 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:14,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-01-10 07:10:15,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 14 equivalence classes. [2025-01-10 07:10:15,294 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 07:10:15,294 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-01-10 07:10:15,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:15,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-10 07:10:15,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:15,308 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 [2025-01-10 07:10:15,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2025-01-10 07:10:15,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:10:15,357 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 30 treesize of output 32 [2025-01-10 07:10:15,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:10:15,390 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 39 treesize of output 44 [2025-01-10 07:10:15,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:10:15,426 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 48 treesize of output 56 [2025-01-10 07:10:15,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 07:10:15,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-01-10 07:10:15,590 INFO L349 Elim1Store]: treesize reduction 162, result has 26.0 percent of original size [2025-01-10 07:10:15,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 79 treesize of output 100 [2025-01-10 07:10:16,198 INFO L349 Elim1Store]: treesize reduction 143, result has 25.1 percent of original size [2025-01-10 07:10:16,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 38 case distinctions, treesize of input 120 treesize of output 139 [2025-01-10 07:10:16,711 INFO L349 Elim1Store]: treesize reduction 127, result has 27.4 percent of original size [2025-01-10 07:10:16,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 116 treesize of output 132 [2025-01-10 07:10:17,145 INFO L349 Elim1Store]: treesize reduction 254, result has 28.0 percent of original size [2025-01-10 07:10:17,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 143 treesize of output 195 [2025-01-10 07:10:18,715 INFO L349 Elim1Store]: treesize reduction 258, result has 26.9 percent of original size [2025-01-10 07:10:18,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 143 treesize of output 182 [2025-01-10 07:10:19,896 INFO L349 Elim1Store]: treesize reduction 660, result has 22.3 percent of original size [2025-01-10 07:10:19,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 86 case distinctions, treesize of input 227 treesize of output 314 [2025-01-10 07:10:23,710 INFO L349 Elim1Store]: treesize reduction 660, result has 22.3 percent of original size [2025-01-10 07:10:23,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 86 case distinctions, treesize of input 227 treesize of output 314