./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 48c9605d 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-?-48c9605-m [2025-02-08 14:26:48,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:26:48,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:26:48,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:26:48,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:26:48,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:26:48,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:26:48,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:26:48,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:26:48,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:26:48,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:26:48,102 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:26:48,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:26:48,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:26:48,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:26:48,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:26:48,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:26:48,103 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:26:48,104 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-02-08 14:26:48,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:26:48,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:26:48,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:26:48,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:26:48,341 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:26:48,343 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-02-08 14:26:49,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8f86b7db/d015249017c642a9801845b08001d7df/FLAG4edadc0bd [2025-02-08 14:26:49,763 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:26:49,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2025-02-08 14:26:49,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8f86b7db/d015249017c642a9801845b08001d7df/FLAG4edadc0bd [2025-02-08 14:26:49,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d8f86b7db/d015249017c642a9801845b08001d7df [2025-02-08 14:26:49,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:26:49,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:26:49,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:26:49,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:26:49,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:26:49,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:26:49" (1/1) ... [2025-02-08 14:26:49,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72645251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:49, skipping insertion in model container [2025-02-08 14:26:49,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:26:49" (1/1) ... [2025-02-08 14:26:49,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:26:49,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:26:50,008 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:26:50,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:26:50,059 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:26:50,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50 WrapperNode [2025-02-08 14:26:50,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:26:50,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:26:50,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:26:50,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:26:50,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,088 INFO L138 Inliner]: procedures = 151, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-02-08 14:26:50,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:26:50,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:26:50,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:26:50,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:26:50,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,104 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-02-08 14:26:50,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:26:50,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:26:50,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:26:50,117 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:26:50,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (1/1) ... [2025-02-08 14:26:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:50,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:50,151 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-02-08 14:26:50,157 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-02-08 14:26:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:26:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:26:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:26:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:26:50,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:26:50,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:26:50,237 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:26:50,240 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:26:50,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: call ULTIMATE.dealloc(main_#t~malloc206#1.base, main_#t~malloc206#1.offset);havoc main_#t~malloc206#1.base, main_#t~malloc206#1.offset; [2025-02-08 14:26:50,361 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-08 14:26:50,361 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:26:50,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:26:50,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:26:50,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:26:50 BoogieIcfgContainer [2025-02-08 14:26:50,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:26:50,368 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:26:50,368 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:26:50,371 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:26:50,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:26:50,372 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:26:49" (1/3) ... [2025-02-08 14:26:50,373 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176780be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:26:50, skipping insertion in model container [2025-02-08 14:26:50,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:26:50,373 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:26:50" (2/3) ... [2025-02-08 14:26:50,373 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@176780be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:26:50, skipping insertion in model container [2025-02-08 14:26:50,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:26:50,373 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:26:50" (3/3) ... [2025-02-08 14:26:50,374 INFO L363 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2025-02-08 14:26:50,409 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:26:50,409 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:26:50,409 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:26:50,409 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:26:50,409 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:26:50,410 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:26:50,410 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:26:50,410 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:26:50,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) 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-02-08 14:26:50,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:26:50,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:50,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:50,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:26:50,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:26:50,430 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:26:50,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) 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-02-08 14:26:50,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-02-08 14:26:50,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:50,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:50,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:26:50,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:26:50,437 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-02-08 14:26:50,437 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-02-08 14:26:50,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1599711, now seen corresponding path program 1 times [2025-02-08 14:26:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754521580] [2025-02-08 14:26:50,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:50,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:26:50,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:26:50,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:50,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:50,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:50,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:26:50,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:26:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:50,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-02-08 14:26:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705271973] [2025-02-08 14:26:50,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:50,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:26:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:26:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:50,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:50,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:26:50,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:26:50,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:50,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:50,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash 49591054, now seen corresponding path program 1 times [2025-02-08 14:26:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894193146] [2025-02-08 14:26:50,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:50,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:50,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:50,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:50,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:50,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:50,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:50,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:50,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:50,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:50,948 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:26:50,948 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:26:50,949 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:26:50,949 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:26:50,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:26:50,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:50,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:26:50,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:26:50,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2025-02-08 14:26:50,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:26:50,951 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:26:50,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:50,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:50,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:50,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:51,489 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:26:51,491 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:26:51,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:51,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:51,494 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-02-08 14:26:51,496 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-02-08 14:26:51,497 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-02-08 14:26:51,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:51,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:51,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:51,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:51,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:51,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:51,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:51,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:51,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:51,530 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-02-08 14:26:51,531 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-02-08 14:26:51,532 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-02-08 14:26:51,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:51,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:51,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:51,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:51,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:51,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:51,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:51,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:51,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:51,553 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-02-08 14:26:51,554 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-02-08 14:26:51,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-02-08 14:26:51,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:51,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:51,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:51,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:51,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:51,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:51,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:51,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:51,573 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-02-08 14:26:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:51,577 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-02-08 14:26:51,578 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-02-08 14:26:51,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-02-08 14:26:51,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:51,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:51,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:51,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:51,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:51,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:51,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:51,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:51,596 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-02-08 14:26:51,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:51,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:51,598 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-02-08 14:26:51,599 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-02-08 14:26:51,601 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-02-08 14:26:51,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:51,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:51,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:51,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:51,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:51,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:51,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:26:51,652 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-08 14:26:51,654 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-08 14:26:51,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:51,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:51,659 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-02-08 14:26:51,660 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-02-08 14:26:51,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:26:51,677 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:26:51,677 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:26:51,678 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:26:51,685 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-02-08 14:26:51,698 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-02-08 14:26:51,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:51,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:26:51,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:26:51,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:51,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:26:51,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:51,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:26:51,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:26:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:51,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:26:51,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:51,784 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-02-08 14:26:51,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:51,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) 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). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 23 transitions. Complement of second has 3 states. [2025-02-08 14:26:51,808 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-02-08 14:26:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2025-02-08 14:26:51,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-08 14:26:51,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:51,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2025-02-08 14:26:51,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:51,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-08 14:26:51,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:51,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2025-02-08 14:26:51,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:26:51,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 16 transitions. [2025-02-08 14:26:51,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:26:51,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:26:51,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-02-08 14:26:51,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:26:51,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-02-08 14:26:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-02-08 14:26:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-02-08 14:26:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 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-02-08 14:26:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-02-08 14:26:51,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-02-08 14:26:51,837 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-02-08 14:26:51,837 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:26:51,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-02-08 14:26:51,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:26:51,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:51,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:51,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:26:51,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:26:51,838 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-02-08 14:26:51,839 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-02-08 14:26:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 49591053, now seen corresponding path program 1 times [2025-02-08 14:26:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754397241] [2025-02-08 14:26:51,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:51,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:51,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:51,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:51,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:51,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:51,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 40676, now seen corresponding path program 1 times [2025-02-08 14:26:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098602204] [2025-02-08 14:26:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:26:51,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:26:51,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:51,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:51,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098602204] [2025-02-08 14:26:51,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098602204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:26:51,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:26:51,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:26:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080348095] [2025-02-08 14:26:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:26:51,880 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:26:51,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:26:51,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:26:51,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:26:51,882 INFO L87 Difference]: Start difference. First operand 10 states and 15 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-02-08 14:26:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:26:51,884 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2025-02-08 14:26:51,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2025-02-08 14:26:51,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:26:51,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2025-02-08 14:26:51,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:26:51,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:26:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-02-08 14:26:51,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:26:51,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-08 14:26:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-02-08 14:26:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-08 14:26:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-02-08 14:26:51,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-08 14:26:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:26:51,887 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-02-08 14:26:51,887 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:26:51,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-02-08 14:26:51,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:26:51,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:51,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:51,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:26:51,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:26:51,888 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-02-08 14:26:51,888 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < main_~length~0#1;" "assume true;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-02-08 14:26:51,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash 49591053, now seen corresponding path program 2 times [2025-02-08 14:26:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073903367] [2025-02-08 14:26:51,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:51,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:51,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:51,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:26:51,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:51,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:51,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:51,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1260092, now seen corresponding path program 1 times [2025-02-08 14:26:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581931210] [2025-02-08 14:26:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:51,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:26:51,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:26:51,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:26:51,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:26:51,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:51,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1142916936, now seen corresponding path program 1 times [2025-02-08 14:26:51,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:51,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265974716] [2025-02-08 14:26:51,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:51,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:51,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:26:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:26:51,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:51,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:26:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:26:51,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:51,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:51,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:52,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:26:52,138 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:26:52,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:26:52,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:26:52,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:26:52,139 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:26:52,139 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,139 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:26:52,139 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:26:52,139 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration3_Lasso [2025-02-08 14:26:52,139 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:26:52,139 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:26:52,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:52,418 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:26:52,418 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:26:52,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,422 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-02-08 14:26:52,424 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-02-08 14:26:52,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-02-08 14:26:52,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:26:52,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,454 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-02-08 14:26:52,455 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-02-08 14:26:52,456 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-02-08 14:26:52,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:52,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,477 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-02-08 14:26:52,480 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-02-08 14:26:52,481 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-02-08 14:26:52,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,513 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-02-08 14:26:52,519 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-02-08 14:26:52,519 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-02-08 14:26:52,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,544 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-02-08 14:26:52,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,551 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-02-08 14:26:52,552 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-02-08 14:26:52,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:26:52,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:52,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,575 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-02-08 14:26:52,580 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-02-08 14:26:52,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:26:52,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:26:52,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,612 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-02-08 14:26:52,613 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-02-08 14:26:52,614 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-02-08 14:26:52,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,631 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-02-08 14:26:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,633 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-02-08 14:26:52,634 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-02-08 14:26:52,635 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-02-08 14:26:52,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,652 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-02-08 14:26:52,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,654 INFO L229 MonitoredProcess]: Starting monitored process 16 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-02-08 14:26:52,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:26:52,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-02-08 14:26:52,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-08 14:26:52,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,674 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-02-08 14:26:52,675 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-02-08 14:26:52,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:26:52,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:52,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:52,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:52,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,693 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-02-08 14:26:52,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,695 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-02-08 14:26:52,697 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-02-08 14:26:52,701 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-02-08 14:26:52,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:52,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:52,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,731 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-02-08 14:26:52,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,733 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-02-08 14:26:52,736 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-02-08 14:26:52,737 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-02-08 14:26:52,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:52,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:52,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,765 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-02-08 14:26:52,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,770 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-02-08 14:26:52,772 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-02-08 14:26:52,773 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-02-08 14:26:52,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:52,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:52,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,797 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-02-08 14:26:52,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,803 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-02-08 14:26:52,805 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-02-08 14:26:52,806 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-02-08 14:26:52,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:52,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:52,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:52,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-08 14:26:52,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,833 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-02-08 14:26:52,834 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-02-08 14:26:52,836 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-02-08 14:26:52,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:52,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:52,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:52,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:52,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:52,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:52,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:26:52,882 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-02-08 14:26:52,882 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-08 14:26:52,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:52,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:52,885 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-02-08 14:26:52,886 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-02-08 14:26:52,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:26:52,896 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:26:52,896 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:26:52,896 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2025-02-08 14:26:52,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:52,909 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-02-08 14:26:52,912 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:26:52,912 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:26:52,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:52,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:26:52,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:26:52,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:52,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:26:52,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:52,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:26:52,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:26:52,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:52,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:52,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:26:52,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:52,982 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-08 14:26:52,982 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:53,018 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 14 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 7 states. [2025-02-08 14:26:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:26:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-02-08 14:26:53,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-08 14:26:53,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:53,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-08 14:26:53,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:53,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2025-02-08 14:26:53,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:53,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-02-08 14:26:53,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:53,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2025-02-08 14:26:53,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:26:53,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:26:53,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2025-02-08 14:26:53,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:53,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-08 14:26:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2025-02-08 14:26:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-02-08 14:26:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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-02-08 14:26:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-02-08 14:26:53,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-02-08 14:26:53,021 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-02-08 14:26:53,021 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:26:53,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-02-08 14:26:53,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:53,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:53,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:53,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:26:53,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:53,021 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-02-08 14:26:53,022 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:53,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1537322654, now seen corresponding path program 1 times [2025-02-08 14:26:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488188947] [2025-02-08 14:26:53,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:26:53,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:26:53,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:53,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:26:53,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:26:53,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:53,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2025-02-08 14:26:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504415286] [2025-02-08 14:26:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:53,053 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-02-08 14:26:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:53,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:53,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:53,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:53,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:53,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,067 INFO L85 PathProgramCache]: Analyzing trace with hash -101679043, now seen corresponding path program 1 times [2025-02-08 14:26:53,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253207167] [2025-02-08 14:26:53,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:53,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:26:53,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:26:53,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:53,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253207167] [2025-02-08 14:26:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253207167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:26:53,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:26:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:26:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984591442] [2025-02-08 14:26:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:26:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:26:53,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:26:53,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:26:53,304 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. cyclomatic complexity: 9 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:26:53,344 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2025-02-08 14:26:53,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2025-02-08 14:26:53,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:53,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 29 transitions. [2025-02-08 14:26:53,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:26:53,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:26:53,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-02-08 14:26:53,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:53,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-08 14:26:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-02-08 14:26:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2025-02-08 14:26:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-02-08 14:26:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-02-08 14:26:53,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-02-08 14:26:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:26:53,350 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-02-08 14:26:53,350 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:26:53,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2025-02-08 14:26:53,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:53,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:53,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:53,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:26:53,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:53,352 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;" "assume true;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-02-08 14:26:53,352 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1070686659, now seen corresponding path program 2 times [2025-02-08 14:26:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643087226] [2025-02-08 14:26:53,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:26:53,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:26:53,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:26:53,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643087226] [2025-02-08 14:26:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643087226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:26:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85596177] [2025-02-08 14:26:53,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:53,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:26:53,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:53,420 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:26:53,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-08 14:26:53,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:26:53,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:26:53,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:26:53,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:53,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:26:53,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:53,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:26:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85596177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:26:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:26:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:26:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916981225] [2025-02-08 14:26:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:26:53,496 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:26:53,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 2 times [2025-02-08 14:26:53,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895073270] [2025-02-08 14:26:53,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:53,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:53,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:53,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:26:53,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:53,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:53,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:26:53,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:26:53,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:26:53,534 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-02-08 14:26:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:26:53,556 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-02-08 14:26:53,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2025-02-08 14:26:53,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:53,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2025-02-08 14:26:53,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:26:53,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:26:53,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2025-02-08 14:26:53,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:53,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-08 14:26:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2025-02-08 14:26:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 14:26:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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-02-08 14:26:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-02-08 14:26:53,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-08 14:26:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:26:53,562 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-08 14:26:53,562 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:26:53,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-02-08 14:26:53,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:53,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:53,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:53,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:26:53,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:53,563 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;" "assume true;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-02-08 14:26:53,564 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -250409806, now seen corresponding path program 1 times [2025-02-08 14:26:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408375262] [2025-02-08 14:26:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:26:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:26:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:53,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:26:53,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:26:53,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:53,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 3 times [2025-02-08 14:26:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626531947] [2025-02-08 14:26:53,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:26:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:53,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:53,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:26:53,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:53,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -125654703, now seen corresponding path program 1 times [2025-02-08 14:26:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755909439] [2025-02-08 14:26:53,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:26:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:53,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:26:53,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:26:53,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:53,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:26:53,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:26:53,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:53,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:53,902 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:26:53,902 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:26:53,902 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:26:53,902 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:26:53,902 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:26:53,902 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:53,902 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:26:53,902 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:26:53,902 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration6_Lasso [2025-02-08 14:26:53,902 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:26:53,902 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:26:53,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:53,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:53,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:53,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:53,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:53,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:53,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:54,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:54,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:54,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:54,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:54,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:54,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:26:54,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:26:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,239 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-02-08 14:26:54,240 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-02-08 14:26:54,241 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-02-08 14:26:54,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:54,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:54,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:54,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,257 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-02-08 14:26:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,259 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-02-08 14:26:54,260 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-02-08 14:26:54,261 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-02-08 14:26:54,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:54,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:54,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:54,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,284 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-02-08 14:26:54,285 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-02-08 14:26:54,287 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-02-08 14:26:54,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:54,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:54,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:54,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:54,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,310 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-02-08 14:26:54,310 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-02-08 14:26:54,312 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-02-08 14:26:54,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:54,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:54,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,332 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-02-08 14:26:54,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,334 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-02-08 14:26:54,336 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-02-08 14:26:54,339 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-02-08 14:26:54,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:54,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:54,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:54,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,361 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-02-08 14:26:54,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,363 INFO L229 MonitoredProcess]: Starting monitored process 30 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-02-08 14:26:54,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:26:54,366 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-02-08 14:26:54,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:26:54,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:26:54,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:26:54,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-08 14:26:54,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,388 INFO L229 MonitoredProcess]: Starting monitored process 31 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-02-08 14:26:54,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:26:54,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:26:54,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:54,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:54,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:54,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,416 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-02-08 14:26:54,417 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-02-08 14:26:54,418 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-02-08 14:26:54,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:54,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:54,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:54,444 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-02-08 14:26:54,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,448 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-02-08 14:26:54,450 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-02-08 14:26:54,451 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-02-08 14:26:54,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:54,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:54,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:54,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:54,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:54,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:54,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:26:54,478 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-08 14:26:54,478 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-08 14:26:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:54,480 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-02-08 14:26:54,482 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-02-08 14:26:54,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:26:54,494 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:26:54,494 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:26:54,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) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2025-02-08 14:26:54,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-08 14:26:54,520 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-02-08 14:26:54,522 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:26:54,522 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:26:54,522 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-08 14:26:54,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:54,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:26:54,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:26:54,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:54,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:54,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:54,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:54,637 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-02-08 14:26:54,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:54,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:54,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:54,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:54,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:54,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:54,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:26:54,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:54,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 19 transitions. Complement of second has 5 states. [2025-02-08 14:26:54,704 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-02-08 14:26:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:26:54,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-08 14:26:54,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:54,705 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:26:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:54,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:26:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:26:54,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:54,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:54,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:54,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:54,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:54,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:54,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:54,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:54,828 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:26:54,828 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:54,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 19 transitions. Complement of second has 5 states. [2025-02-08 14:26:54,861 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-02-08 14:26:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:26:54,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-08 14:26:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:54,861 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:26:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:54,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:26:54,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:26:54,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:54,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:54,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:54,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:54,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:54,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:54,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:54,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:54,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:54,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:54,997 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:26:54,997 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:55,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 36 transitions. Complement of second has 11 states. [2025-02-08 14:26:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-08 14:26:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2025-02-08 14:26:55,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-08 14:26:55,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:55,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-08 14:26:55,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:55,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-08 14:26:55,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:55,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2025-02-08 14:26:55,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:55,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 29 transitions. [2025-02-08 14:26:55,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:26:55,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:26:55,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2025-02-08 14:26:55,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:55,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-08 14:26:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2025-02-08 14:26:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-02-08 14:26:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-02-08 14:26:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-08 14:26:55,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-08 14:26:55,091 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-08 14:26:55,091 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:26:55,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-02-08 14:26:55,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:55,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:55,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:55,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:26:55,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:55,092 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;" "assume true;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;" "assume true;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-02-08 14:26:55,092 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -495086121, now seen corresponding path program 2 times [2025-02-08 14:26:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694694894] [2025-02-08 14:26:55,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:55,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-08 14:26:55,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:26:55,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:26:55,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:55,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:55,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694694894] [2025-02-08 14:26:55,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694694894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:26:55,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359849661] [2025-02-08 14:26:55,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:55,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:26:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:55,156 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:26:55,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-02-08 14:26:55,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-08 14:26:55,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:26:55,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:26:55,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:55,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:26:55,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:55,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:26:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359849661] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:26:55,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:26:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-08 14:26:55,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964228395] [2025-02-08 14:26:55,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:26:55,303 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:26:55,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 4 times [2025-02-08 14:26:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781816927] [2025-02-08 14:26:55,303 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:26:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:55,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-08 14:26:55,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:55,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:26:55,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:55,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:55,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:55,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:55,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:55,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:55,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:26:55,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:26:55,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:26:55,342 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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-02-08 14:26:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:26:55,390 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-02-08 14:26:55,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2025-02-08 14:26:55,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:55,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 26 transitions. [2025-02-08 14:26:55,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:26:55,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:26:55,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2025-02-08 14:26:55,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:55,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-08 14:26:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2025-02-08 14:26:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 14:26:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-02-08 14:26:55,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-08 14:26:55,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:26:55,393 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-02-08 14:26:55,393 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:26:55,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-02-08 14:26:55,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:55,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:55,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:55,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:26:55,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:55,394 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;" "assume true;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;" "assume true;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-02-08 14:26:55,394 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:55,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2121504696, now seen corresponding path program 3 times [2025-02-08 14:26:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752839176] [2025-02-08 14:26:55,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:26:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:55,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-02-08 14:26:55,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:26:55,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:26:55,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752839176] [2025-02-08 14:26:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752839176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:26:55,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205959970] [2025-02-08 14:26:55,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:26:55,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:26:55,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:55,690 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:26:55,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-02-08 14:26:55,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-02-08 14:26:55,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:26:55,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:26:55,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:55,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 14:26:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:55,759 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-02-08 14:26:55,771 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-02-08 14:26:55,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:26:55,794 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-02-08 14:26:55,925 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-08 14:26:55,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 29 [2025-02-08 14:26:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:56,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:26:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205959970] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:26:56,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:26:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-08 14:26:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609439151] [2025-02-08 14:26:56,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:26:56,305 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:26:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 5 times [2025-02-08 14:26:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205010297] [2025-02-08 14:26:56,305 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:26:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:56,312 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:56,314 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:56,314 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:26:56,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:56,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:56,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:56,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:56,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:56,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:26:56,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:26:56,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-02-08 14:26:56,350 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 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-02-08 14:26:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:26:57,357 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2025-02-08 14:26:57,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2025-02-08 14:26:57,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:57,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 41 transitions. [2025-02-08 14:26:57,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-08 14:26:57,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:26:57,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2025-02-08 14:26:57,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:57,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-08 14:26:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2025-02-08 14:26:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2025-02-08 14:26:57,359 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-02-08 14:26:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-08 14:26:57,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-08 14:26:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 14:26:57,359 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-08 14:26:57,359 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:26:57,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2025-02-08 14:26:57,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:57,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:57,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:57,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:26:57,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:57,360 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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:26:57,360 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:57,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1344521511, now seen corresponding path program 2 times [2025-02-08 14:26:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-02-08 14:26:57,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:26:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:57,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:26:57,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:26:57,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:26:57,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:57,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:57,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:26:57,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:26:57,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:57,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:57,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 6 times [2025-02-08 14:26:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289387689] [2025-02-08 14:26:57,393 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:26:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:57,395 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:57,397 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:57,397 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:26:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:57,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:57,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:57,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:57,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:57,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:57,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -699983738, now seen corresponding path program 3 times [2025-02-08 14:26:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919555507] [2025-02-08 14:26:57,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:26:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:57,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-02-08 14:26:57,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:26:57,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:26:57,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:57,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:26:57,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:26:57,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:57,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:57,937 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:26:57,937 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:26:57,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:26:57,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:26:57,937 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:26:57,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:57,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:26:57,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:26:57,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration9_Lasso [2025-02-08 14:26:57,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:26:57,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:26:57,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:57,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:26:58,225 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:26:58,225 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:26:58,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,227 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-02-08 14:26:58,228 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-02-08 14:26:58,229 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-02-08 14:26:58,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:58,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:58,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:58,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:58,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:58,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:58,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:58,248 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-02-08 14:26:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,249 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-02-08 14:26:58,250 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-02-08 14:26:58,251 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-02-08 14:26:58,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:58,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:58,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:58,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:58,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:58,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:58,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:58,278 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-02-08 14:26:58,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,280 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-02-08 14:26:58,280 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-02-08 14:26:58,282 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-02-08 14:26:58,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:58,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:58,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:58,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:58,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:58,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:58,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:58,302 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-02-08 14:26:58,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,303 INFO L229 MonitoredProcess]: Starting monitored process 40 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-02-08 14:26:58,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:26:58,305 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-02-08 14:26:58,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:58,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:58,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:58,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:58,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:58,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:58,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:58,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-02-08 14:26:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,330 INFO L229 MonitoredProcess]: Starting monitored process 41 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-02-08 14:26:58,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:26:58,332 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-02-08 14:26:58,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:58,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:58,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:58,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:58,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:58,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:58,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:26:58,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:26:58,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,354 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-02-08 14:26:58,355 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-02-08 14:26:58,356 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-02-08 14:26:58,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:26:58,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:26:58,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:26:58,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:26:58,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:26:58,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:26:58,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:26:58,380 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-08 14:26:58,380 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-08 14:26:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:26:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,382 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-02-08 14:26:58,382 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-02-08 14:26:58,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:26:58,393 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:26:58,393 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:26:58,393 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 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2025-02-08 14:26:58,398 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-02-08 14:26:58,409 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-02-08 14:26:58,410 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:26:58,410 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:26:58,410 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-08 14:26:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:58,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:26:58,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:26:58,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:58,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:58,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:58,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:58,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:58,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:58,512 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-08 14:26:58,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,532 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-02-08 14:26:58,541 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 29 transitions. Complement of second has 4 states. [2025-02-08 14:26:58,541 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-02-08 14:26:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:26:58,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 18 letters. Loop has 2 letters. [2025-02-08 14:26:58,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:58,542 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:26:58,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:58,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:26:58,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:26:58,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:58,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:58,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:58,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:58,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:58,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:58,641 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-08 14:26:58,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 29 transitions. Complement of second has 4 states. [2025-02-08 14:26:58,659 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-02-08 14:26:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:26:58,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 18 letters. Loop has 2 letters. [2025-02-08 14:26:58,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:58,659 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:26:58,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:58,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:26:58,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:26:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:58,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:58,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:58,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:58,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:58,758 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-08 14:26:58,758 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 48 transitions. Complement of second has 12 states. [2025-02-08 14:26:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-08 14:26:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-02-08 14:26:58,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 18 letters. Loop has 2 letters. [2025-02-08 14:26:58,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:58,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 2 letters. [2025-02-08 14:26:58,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:58,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 18 letters. Loop has 4 letters. [2025-02-08 14:26:58,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:26:58,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-02-08 14:26:58,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:58,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 34 states and 40 transitions. [2025-02-08 14:26:58,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:26:58,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:26:58,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2025-02-08 14:26:58,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:58,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-02-08 14:26:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2025-02-08 14:26:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-02-08 14:26:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:26:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-08 14:26:58,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-08 14:26:58,823 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-08 14:26:58,823 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:26:58,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2025-02-08 14:26:58,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:58,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:58,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:58,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:26:58,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:58,823 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:26:58,823 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1268803669, now seen corresponding path program 4 times [2025-02-08 14:26:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:58,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870951165] [2025-02-08 14:26:58,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:26:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:58,828 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:26:58,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 24 statements. [2025-02-08 14:26:58,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:26:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:26:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:58,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870951165] [2025-02-08 14:26:58,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870951165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:26:58,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039257725] [2025-02-08 14:26:58,906 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:26:58,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:26:58,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:58,911 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:26:58,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-02-08 14:26:58,950 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-02-08 14:26:58,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 24 statements. [2025-02-08 14:26:58,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:26:58,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:58,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:26:58,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:26:59,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:26:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:26:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039257725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:26:59,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:26:59,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-08 14:26:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94352279] [2025-02-08 14:26:59,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:26:59,076 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:26:59,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 7 times [2025-02-08 14:26:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:59,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128925358] [2025-02-08 14:26:59,076 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:26:59,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:59,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:59,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:59,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:59,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:59,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:26:59,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:26:59,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:26:59,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:26:59,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:26:59,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:26:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:26:59,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 14:26:59,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-08 14:26:59,111 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 11 Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 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-02-08 14:26:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:26:59,153 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-02-08 14:26:59,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2025-02-08 14:26:59,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:59,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 31 states and 37 transitions. [2025-02-08 14:26:59,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:26:59,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:26:59,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2025-02-08 14:26:59,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:26:59,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-08 14:26:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2025-02-08 14:26:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 14:26:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-02-08 14:26:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-08 14:26:59,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-08 14:26:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:26:59,157 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-08 14:26:59,157 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:26:59,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2025-02-08 14:26:59,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:26:59,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:26:59,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:26:59,158 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 14:26:59,158 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:26:59,158 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:26:59,158 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:26:59,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:26:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 944239706, now seen corresponding path program 5 times [2025-02-08 14:26:59,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:26:59,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790428148] [2025-02-08 14:26:59,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:26:59,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:26:59,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 6 equivalence classes. [2025-02-08 14:26:59,179 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:26:59,179 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-08 14:26:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:26:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:26:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790428148] [2025-02-08 14:26:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790428148] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:26:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664013742] [2025-02-08 14:26:59,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:26:59,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:26:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:26:59,752 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:26:59,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-02-08 14:26:59,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 6 equivalence classes. [2025-02-08 14:26:59,807 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:26:59,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-08 14:26:59,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:26:59,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 14:26:59,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:26:59,824 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-02-08 14:26:59,861 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-02-08 14:26:59,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:26:59,894 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-02-08 14:26:59,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:26:59,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:26:59,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:26:59,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:26:59,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:26:59,938 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:26:59,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2025-02-08 14:27:00,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,141 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:27:00,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 49 [2025-02-08 14:27:00,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:00,298 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2025-02-08 14:27:00,298 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 49 treesize of output 51 [2025-02-08 14:27:00,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:00,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 75 [2025-02-08 14:27:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:00,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2025-02-08 14:27:00,684 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 14:27:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:27:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664013742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:00,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:00,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-02-08 14:27:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000204274] [2025-02-08 14:27:00,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:00,685 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 8 times [2025-02-08 14:27:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339226989] [2025-02-08 14:27:00,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:00,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:00,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:00,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:00,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:00,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:00,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:00,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:00,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:00,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:00,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 14:27:00,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 14:27:00,724 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 11 Second operand has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:01,179 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-02-08 14:27:01,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2025-02-08 14:27:01,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:01,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 39 transitions. [2025-02-08 14:27:01,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:27:01,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:27:01,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2025-02-08 14:27:01,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:01,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-08 14:27:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2025-02-08 14:27:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-02-08 14:27:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-02-08 14:27:01,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-08 14:27:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 14:27:01,183 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-08 14:27:01,183 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:27:01,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2025-02-08 14:27:01,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:01,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:01,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:01,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 14:27:01,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:27:01,184 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:27:01,184 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:27:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1177326777, now seen corresponding path program 6 times [2025-02-08 14:27:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989222952] [2025-02-08 14:27:01,185 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:27:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:01,190 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 6 equivalence classes. [2025-02-08 14:27:01,209 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:01,209 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-08 14:27:01,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:01,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:01,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:01,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:01,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:01,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:01,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:01,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 9 times [2025-02-08 14:27:01,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352815189] [2025-02-08 14:27:01,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:01,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:01,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:01,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:27:01,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:01,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:01,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:01,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:01,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:01,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:01,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:01,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1834634136, now seen corresponding path program 7 times [2025-02-08 14:27:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:01,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112188008] [2025-02-08 14:27:01,225 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:27:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:01,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:27:01,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:27:01,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:01,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:01,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:27:01,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:27:01,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:01,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:01,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:02,656 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:02,656 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:02,656 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:02,656 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:02,656 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:02,656 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:02,656 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:02,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:02,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration12_Lasso [2025-02-08 14:27:02,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:02,656 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:02,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:02,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:03,041 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:03,041 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,044 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-02-08 14:27:03,044 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-02-08 14:27:03,045 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-02-08 14:27:03,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,061 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-02-08 14:27:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,063 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-02-08 14:27:03,064 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-02-08 14:27:03,065 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-02-08 14:27:03,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,082 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-02-08 14:27:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,084 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-02-08 14:27:03,087 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-02-08 14:27:03,087 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-02-08 14:27:03,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,105 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-02-08 14:27:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,107 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-02-08 14:27:03,108 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-02-08 14:27:03,109 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-02-08 14:27:03,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,125 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-02-08 14:27:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,127 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-02-08 14:27:03,128 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-02-08 14:27:03,129 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-02-08 14:27:03,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,148 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-02-08 14:27:03,149 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-02-08 14:27:03,150 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-02-08 14:27:03,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-08 14:27:03,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,168 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-02-08 14:27:03,169 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-02-08 14:27:03,170 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-02-08 14:27:03,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,186 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-02-08 14:27:03,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,188 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-02-08 14:27:03,188 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-02-08 14:27:03,190 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-02-08 14:27:03,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-08 14:27:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,208 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-02-08 14:27:03,209 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-02-08 14:27:03,210 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-02-08 14:27:03,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:03,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:03,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:03,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,226 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-02-08 14:27:03,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,229 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-02-08 14:27:03,229 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-02-08 14:27:03,230 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-02-08 14:27:03,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:03,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:03,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,248 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-02-08 14:27:03,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,251 INFO L229 MonitoredProcess]: Starting monitored process 56 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-02-08 14:27:03,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-08 14:27:03,252 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-02-08 14:27:03,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:03,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:03,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:03,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-08 14:27:03,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,274 INFO L229 MonitoredProcess]: Starting monitored process 57 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-02-08 14:27:03,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-08 14:27:03,275 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-02-08 14:27:03,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:03,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:03,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:03,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:03,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:03,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:03,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:03,303 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-08 14:27:03,303 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-08 14:27:03,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,305 INFO L229 MonitoredProcess]: Starting monitored process 58 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-02-08 14:27:03,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-08 14:27:03,307 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:03,317 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:27:03,317 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:03,317 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-02-08 14:27:03,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-08 14:27:03,343 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-02-08 14:27:03,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:27:03,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:27:03,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-08 14:27:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:03,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:03,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:03,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:03,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:27:03,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:03,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-08 14:27:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:03,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:03,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:03,484 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:27:03,484 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 14:27:03,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Result 33 states and 38 transitions. Complement of second has 4 states. [2025-02-08 14:27:03,500 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-02-08 14:27:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 14:27:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:27:03,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 2 letters. [2025-02-08 14:27:03,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:03,501 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:27:03,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:03,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:03,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:03,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:03,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:27:03,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:03,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:03,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:03,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:03,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:03,625 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:27:03,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 14:27:03,642 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Result 33 states and 38 transitions. Complement of second has 4 states. [2025-02-08 14:27:03,642 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-02-08 14:27:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 14:27:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:27:03,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 2 letters. [2025-02-08 14:27:03,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:03,643 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:27:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:03,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:03,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:03,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:03,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:27:03,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:03,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:03,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:03,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:03,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:03,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:03,756 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-08 14:27:03,756 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 14:27:03,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 38 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Result 49 states and 57 transitions. Complement of second has 14 states. [2025-02-08 14:27:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-08 14:27:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 14:27:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2025-02-08 14:27:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 27 letters. Loop has 2 letters. [2025-02-08 14:27:03,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 29 letters. Loop has 2 letters. [2025-02-08 14:27:03,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 27 letters. Loop has 4 letters. [2025-02-08 14:27:03,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:03,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2025-02-08 14:27:03,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:03,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 43 states and 49 transitions. [2025-02-08 14:27:03,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:27:03,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:27:03,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2025-02-08 14:27:03,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:03,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-08 14:27:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2025-02-08 14:27:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-02-08 14:27:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-02-08 14:27:03,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-02-08 14:27:03,833 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-02-08 14:27:03,833 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:27:03,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2025-02-08 14:27:03,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:03,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:03,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:03,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-02-08 14:27:03,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:27:03,834 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:27:03,834 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:27:03,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1503588797, now seen corresponding path program 8 times [2025-02-08 14:27:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333099035] [2025-02-08 14:27:03,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:03,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 14:27:03,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 14:27:03,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:03,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 14:27:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333099035] [2025-02-08 14:27:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333099035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3126268] [2025-02-08 14:27:03,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:03,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:03,943 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:03,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-02-08 14:27:03,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 14:27:04,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 14:27:04,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:04,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:27:04,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 14:27:04,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 14:27:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3126268] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:04,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-02-08 14:27:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173229949] [2025-02-08 14:27:04,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:04,171 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:04,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 10 times [2025-02-08 14:27:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275719804] [2025-02-08 14:27:04,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:04,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-08 14:27:04,174 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:04,174 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:04,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:04,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:04,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:04,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:04,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:04,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 14:27:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-02-08 14:27:04,203 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 11 Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 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-02-08 14:27:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:04,273 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-02-08 14:27:04,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2025-02-08 14:27:04,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:04,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 40 states and 46 transitions. [2025-02-08 14:27:04,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-08 14:27:04,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:27:04,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2025-02-08 14:27:04,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:04,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 14:27:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2025-02-08 14:27:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 14:27:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-08 14:27:04,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 14:27:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:27:04,281 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 14:27:04,281 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:27:04,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2025-02-08 14:27:04,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:04,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:04,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:04,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 14:27:04,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:27:04,282 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:27:04,282 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:27:04,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 496134638, now seen corresponding path program 9 times [2025-02-08 14:27:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863140693] [2025-02-08 14:27:04,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:04,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 7 equivalence classes. [2025-02-08 14:27:04,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:27:04,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 14:27:04,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 55 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 14:27:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863140693] [2025-02-08 14:27:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863140693] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757520366] [2025-02-08 14:27:05,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:05,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:05,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:05,027 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:05,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-02-08 14:27:05,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 7 equivalence classes. [2025-02-08 14:27:05,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:27:05,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 14:27:05,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:05,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 14:27:05,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:05,117 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-02-08 14:27:05,128 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-02-08 14:27:05,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,149 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-02-08 14:27:05,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,171 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-02-08 14:27:05,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,201 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-02-08 14:27:05,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,330 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-02-08 14:27:05,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,417 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-02-08 14:27:05,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,472 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-02-08 14:27:05,537 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-02-08 14:27:05,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:05,574 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-02-08 14:27:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 73 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:27:05,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 67 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 14:27:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757520366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:05,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 41 [2025-02-08 14:27:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069031479] [2025-02-08 14:27:05,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:05,869 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:05,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 11 times [2025-02-08 14:27:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:05,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237745667] [2025-02-08 14:27:05,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:27:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:05,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:05,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:05,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:05,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:05,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:05,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:05,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:05,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:05,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:05,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:05,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 14:27:05,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 14:27:05,901 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 11 Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 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-02-08 14:27:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:07,568 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2025-02-08 14:27:07,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 129 transitions. [2025-02-08 14:27:07,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-08 14:27:07,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 110 states and 123 transitions. [2025-02-08 14:27:07,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-08 14:27:07,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:27:07,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 123 transitions. [2025-02-08 14:27:07,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:07,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 123 transitions. [2025-02-08 14:27:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 123 transitions. [2025-02-08 14:27:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2025-02-08 14:27:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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-02-08 14:27:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2025-02-08 14:27:07,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 96 transitions. [2025-02-08 14:27:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-08 14:27:07,573 INFO L432 stractBuchiCegarLoop]: Abstraction has 84 states and 96 transitions. [2025-02-08 14:27:07,573 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-08 14:27:07,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 96 transitions. [2025-02-08 14:27:07,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:07,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:07,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:07,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 14:27:07,575 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:27:07,575 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:27:07,575 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:27:07,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash 379069676, now seen corresponding path program 10 times [2025-02-08 14:27:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:07,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651251961] [2025-02-08 14:27:07,575 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:07,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-08 14:27:07,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:27:07,599 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:07,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:07,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:07,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:27:07,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:27:07,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:07,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:07,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:07,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 12 times [2025-02-08 14:27:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:07,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469296491] [2025-02-08 14:27:07,620 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:27:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:07,623 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:07,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:07,624 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:27:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:07,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:07,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:07,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:07,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:07,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash -786261237, now seen corresponding path program 11 times [2025-02-08 14:27:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:07,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709224632] [2025-02-08 14:27:07,628 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:27:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:07,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 7 equivalence classes. [2025-02-08 14:27:07,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:27:07,650 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-08 14:27:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:07,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:07,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:27:07,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:27:07,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:07,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:07,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:14,537 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 247 DAG size of output: 189 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-08 14:27:14,721 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:14,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:14,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:14,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:14,721 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:14,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:14,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:14,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:14,721 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration15_Lasso [2025-02-08 14:27:14,721 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:14,721 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:14,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:14,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:14,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:14,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:14,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:14,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:14,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:15,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:15,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:15,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:15,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:15,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:15,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:15,169 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:15,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,172 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-02-08 14:27:15,173 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-02-08 14:27:15,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:15,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:15,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:15,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:15,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,191 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-02-08 14:27:15,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,193 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-02-08 14:27:15,195 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-02-08 14:27:15,195 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-02-08 14:27:15,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:15,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:15,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:15,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-08 14:27:15,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,213 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-02-08 14:27:15,214 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-02-08 14:27:15,215 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-02-08 14:27:15,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,234 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-02-08 14:27:15,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,236 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-02-08 14:27:15,236 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-02-08 14:27:15,237 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-02-08 14:27:15,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:15,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:15,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:15,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,253 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-02-08 14:27:15,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,255 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-02-08 14:27:15,255 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-02-08 14:27:15,256 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-02-08 14:27:15,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:15,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:15,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:15,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-02-08 14:27:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,275 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-02-08 14:27:15,275 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-02-08 14:27:15,276 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-02-08 14:27:15,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:15,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:15,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:15,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,293 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-02-08 14:27:15,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,295 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-02-08 14:27:15,295 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-02-08 14:27:15,296 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-02-08 14:27:15,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:15,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,321 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-02-08 14:27:15,322 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-02-08 14:27:15,322 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-02-08 14:27:15,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,343 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-02-08 14:27:15,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,345 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-02-08 14:27:15,345 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-02-08 14:27:15,346 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-02-08 14:27:15,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,368 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-02-08 14:27:15,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,370 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-02-08 14:27:15,370 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-02-08 14:27:15,371 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-02-08 14:27:15,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,390 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-02-08 14:27:15,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,392 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-02-08 14:27:15,392 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-02-08 14:27:15,393 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-02-08 14:27:15,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,411 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-02-08 14:27:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,413 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-02-08 14:27:15,414 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-02-08 14:27:15,415 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-02-08 14:27:15,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,434 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-02-08 14:27:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,436 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-02-08 14:27:15,437 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-02-08 14:27:15,438 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-02-08 14:27:15,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,460 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-02-08 14:27:15,460 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-02-08 14:27:15,461 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-02-08 14:27:15,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:15,480 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-02-08 14:27:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,482 INFO L229 MonitoredProcess]: Starting monitored process 75 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-02-08 14:27:15,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-08 14:27:15,484 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-02-08 14:27:15,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:15,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:15,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:15,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:15,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:15,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:15,503 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:15,511 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-08 14:27:15,511 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-08 14:27:15,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:15,514 INFO L229 MonitoredProcess]: Starting monitored process 76 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-02-08 14:27:15,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-08 14:27:15,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:15,527 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:27:15,528 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:15,528 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 16)_1 Supporting invariants [] [2025-02-08 14:27:15,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-02-08 14:27:15,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-02-08 14:27:15,587 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2025-02-08 14:27:15,588 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:27:15,588 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:27:15,588 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2025-02-08 14:27:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:15,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:27:15,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:27:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:15,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 14:27:15,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:15,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:15,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:15,833 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-08 14:27:15,833 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 14:27:15,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 84 states and 96 transitions. Complement of second has 5 states. [2025-02-08 14:27:15,883 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-02-08 14:27:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 14:27:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:27:15,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-08 14:27:15,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:15,884 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:27:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:27:15,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:27:15,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:15,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:15,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 14:27:15,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:16,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:16,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:16,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:16,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:16,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:16,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:16,154 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-08 14:27:16,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 14:27:16,204 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 84 states and 96 transitions. Complement of second has 5 states. [2025-02-08 14:27:16,205 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-02-08 14:27:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 14:27:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-08 14:27:16,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-08 14:27:16,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:16,207 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:27:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:16,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:27:16,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:27:16,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:16,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 14:27:16,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:16,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:16,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:16,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:16,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:16,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:16,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:16,425 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-08 14:27:16,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20 Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 14:27:16,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 96 transitions. cyclomatic complexity: 20. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 112 states and 128 transitions. Complement of second has 17 states. [2025-02-08 14:27:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-08 14:27:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 14:27:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2025-02-08 14:27:16,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-08 14:27:16,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:16,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 40 letters. Loop has 2 letters. [2025-02-08 14:27:16,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:16,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 38 letters. Loop has 4 letters. [2025-02-08 14:27:16,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:16,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 128 transitions. [2025-02-08 14:27:16,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:16,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 102 states and 115 transitions. [2025-02-08 14:27:16,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:27:16,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:27:16,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 115 transitions. [2025-02-08 14:27:16,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:16,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-02-08 14:27:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 115 transitions. [2025-02-08 14:27:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2025-02-08 14:27:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 95 states have internal predecessors, (109), 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-02-08 14:27:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2025-02-08 14:27:16,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-02-08 14:27:16,572 INFO L432 stractBuchiCegarLoop]: Abstraction has 96 states and 109 transitions. [2025-02-08 14:27:16,572 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-08 14:27:16,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 109 transitions. [2025-02-08 14:27:16,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:27:16,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:16,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:16,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 8, 6, 5, 5, 4, 1, 1, 1, 1, 1] [2025-02-08 14:27:16,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:27:16,573 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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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;" "assume true;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-02-08 14:27:16,573 INFO L754 eck$LassoCheckResult]: Loop: "assume true;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-02-08 14:27:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:16,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1422429553, now seen corresponding path program 12 times [2025-02-08 14:27:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378274442] [2025-02-08 14:27:16,573 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:27:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:16,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 10 equivalence classes. [2025-02-08 14:27:16,618 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 34 of 46 statements. [2025-02-08 14:27:16,619 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 14:27:16,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 5 proven. 178 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 14:27:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378274442] [2025-02-08 14:27:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378274442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391884454] [2025-02-08 14:27:19,017 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:27:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:19,019 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:19,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-02-08 14:27:19,069 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 10 equivalence classes. [2025-02-08 14:27:19,235 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 34 of 46 statements. [2025-02-08 14:27:19,235 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 14:27:19,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:19,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 14:27:19,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:19,251 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-02-08 14:27:19,259 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-02-08 14:27:19,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:19,272 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-02-08 14:27:19,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:19,285 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-02-08 14:27:19,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:19,323 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-02-08 14:27:19,545 INFO L349 Elim1Store]: treesize reduction 78, result has 53.0 percent of original size [2025-02-08 14:27:19,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 66 treesize of output 117 [2025-02-08 14:27:20,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,097 INFO L349 Elim1Store]: treesize reduction 110, result has 14.1 percent of original size [2025-02-08 14:27:20,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 76 treesize of output 62 [2025-02-08 14:27:20,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,263 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-02-08 14:27:20,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 48 [2025-02-08 14:27:20,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:20,545 INFO L349 Elim1Store]: treesize reduction 122, result has 46.5 percent of original size [2025-02-08 14:27:20,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 78 treesize of output 132 [2025-02-08 14:27:21,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:27:22,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:27:22,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 7 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 367 treesize of output 1177