./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.05-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-memory-alloca/b.05-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 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:24:06,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:24:06,905 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:24:06,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:24:06,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:24:06,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:24:06,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:24:06,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:24:06,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:24:06,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:24:06,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:24:06,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:24:06,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:24:06,946 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:24:06,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:24:06,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:24:06,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:24:06,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:24:06,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:24:06,947 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:24:06,947 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 -> 2e8f354936443b9a529fcf41dfa5e3c742b35e7f73ef50360a09d67c1a48d74d [2025-02-08 14:24:07,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:24:07,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:24:07,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:24:07,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:24:07,235 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:24:07,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2025-02-08 14:24:08,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/646ec17e2/548ca5ca548a4615bc949af8d7dac07b/FLAGb52c114a3 [2025-02-08 14:24:08,734 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:24:08,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2025-02-08 14:24:08,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/646ec17e2/548ca5ca548a4615bc949af8d7dac07b/FLAGb52c114a3 [2025-02-08 14:24:09,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/646ec17e2/548ca5ca548a4615bc949af8d7dac07b [2025-02-08 14:24:09,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:24:09,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:24:09,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:24:09,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:24:09,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:24:09,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a8a1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09, skipping insertion in model container [2025-02-08 14:24:09,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:24:09,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:24:09,244 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:24:09,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:24:09,288 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:24:09,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09 WrapperNode [2025-02-08 14:24:09,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:24:09,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:24:09,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:24:09,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:24:09,294 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:24:09" (1/1) ... [2025-02-08 14:24:09,300 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:24:09" (1/1) ... [2025-02-08 14:24:09,310 INFO L138 Inliner]: procedures = 111, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-02-08 14:24:09,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:24:09,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:24:09,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:24:09,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:24:09,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,325 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [5, 6]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2025-02-08 14:24:09,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:24:09,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:24:09,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:24:09,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:24:09,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (1/1) ... [2025-02-08 14:24:09,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:09,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:09,373 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:24:09,376 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:24:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:24:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:24:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:24:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:24:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:24:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:24:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:24:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:24:09,470 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:24:09,472 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:24:09,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;havoc main_#t~ret17#1; [2025-02-08 14:24:09,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc test_fun_#t~mem14#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset; [2025-02-08 14:24:09,563 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-08 14:24:09,564 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:24:09,568 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:24:09,569 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:24:09,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:09 BoogieIcfgContainer [2025-02-08 14:24:09,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:24:09,570 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:24:09,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:24:09,573 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:24:09,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:24:09,574 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:24:09" (1/3) ... [2025-02-08 14:24:09,574 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e453ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:24:09, skipping insertion in model container [2025-02-08 14:24:09,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:24:09,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:24:09" (2/3) ... [2025-02-08 14:24:09,575 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e453ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:24:09, skipping insertion in model container [2025-02-08 14:24:09,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:24:09,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:09" (3/3) ... [2025-02-08 14:24:09,576 INFO L363 chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i [2025-02-08 14:24:09,604 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:24:09,604 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:24:09,605 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:24:09,605 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:24:09,605 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:24:09,605 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:24:09,605 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:24:09,605 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:24:09,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:09,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:24:09,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:09,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:09,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:24:09,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:24:09,622 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:24:09,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:09,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:24:09,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:09,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:09,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:24:09,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:24:09,626 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~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#1(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;" [2025-02-08 14:24:09,626 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" "assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 >= 0;" "test_fun_#t~short9#1 := test_fun_#t~short7#1;" "assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824;" "test_fun_#t~short11#1 := test_fun_#t~short9#1;" "assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1;" "assume test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#1(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1;" [2025-02-08 14:24:09,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash 52, now seen corresponding path program 1 times [2025-02-08 14:24:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711225448] [2025-02-08 14:24:09,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:09,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:09,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:09,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:09,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:09,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:09,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:09,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:09,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1927412911, now seen corresponding path program 1 times [2025-02-08 14:24:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:09,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158172595] [2025-02-08 14:24:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:24:09,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:24:09,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:09,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:09,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:24:09,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:24:09,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:09,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:09,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 616426780, now seen corresponding path program 1 times [2025-02-08 14:24:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619334512] [2025-02-08 14:24:09,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:09,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:24:09,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:24:09,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:09,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:09,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:09,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:24:09,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:24:09,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:09,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:09,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:10,303 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:24:10,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:24:10,304 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:24:10,304 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:24:10,304 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:24:10,304 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,304 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:24:10,304 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:24:10,304 INFO L132 ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso [2025-02-08 14:24:10,304 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:24:10,304 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:24:10,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:24:10,860 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:24:10,862 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:24:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:10,867 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:24:10,870 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:24:10,871 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:24:10,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:10,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:10,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:10,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:10,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:10,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:10,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:10,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:10,894 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:24:10,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:10,896 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:24:10,896 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:24:10,899 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:24:10,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:10,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:10,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:10,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:10,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:10,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:10,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:10,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:10,919 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:24:10,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:10,924 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:24:10,925 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:24:10,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:10,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:10,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:10,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:10,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:10,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:10,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:10,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:10,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:10,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:24:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:10,947 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:24:10,948 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:24:10,949 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:24:10,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:10,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:10,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:10,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:10,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:10,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:10,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:10,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:10,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:10,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:10,972 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:24:10,972 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:24:10,973 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:24:10,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:10,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:10,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:10,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:10,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:10,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:10,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:10,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:10,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:10,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:10,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,000 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:24:11,001 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:24:11,003 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:24:11,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:11,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:11,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:11,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:11,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,026 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:24:11,027 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:24:11,029 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:24:11,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:11,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:11,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:11,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:11,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:11,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,054 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:24:11,055 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:24:11,056 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:24:11,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:11,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:11,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:11,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:11,076 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:24:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,082 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:24:11,083 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:24:11,083 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:24:11,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:11,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:11,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:11,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:24:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,109 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:24:11,112 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:24:11,113 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:24:11,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:24:11,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:24:11,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:24:11,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:11,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:11,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,132 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:24:11,134 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:24:11,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:24:11,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:11,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:11,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:24:11,157 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:24:11,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,159 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:24:11,161 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:24:11,162 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:24:11,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:24:11,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:24:11,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:24:11,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:24:11,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:24:11,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:24:11,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:24:11,205 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-08 14:24:11,207 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-02-08 14:24:11,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:24:11,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:24:11,210 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:24:11,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:24:11,213 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:24:11,224 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:24:11,225 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:24:11,225 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) 0)_1 Supporting invariants [] [2025-02-08 14:24:11,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:11,253 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2025-02-08 14:24:11,257 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-08 14:24:11,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-08 14:24:11,258 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2025-02-08 14:24:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:11,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:24:11,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:24:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:11,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:24:11,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:11,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:24:11,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:24:11,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:11,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:24:11,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:24:11,401 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:24:11,420 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-08 14:24:11,422 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:24:11,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 56 transitions. Complement of second has 10 states. [2025-02-08 14:24:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-08 14:24:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:24:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2025-02-08 14:24:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 1 letters. Loop has 7 letters. [2025-02-08 14:24:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 8 letters. Loop has 7 letters. [2025-02-08 14:24:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:11,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 1 letters. Loop has 14 letters. [2025-02-08 14:24:11,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:24:11,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2025-02-08 14:24:11,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:24:11,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 23 states and 32 transitions. [2025-02-08 14:24:11,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:24:11,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-08 14:24:11,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2025-02-08 14:24:11,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:11,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-02-08 14:24:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2025-02-08 14:24:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-02-08 14:24:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-02-08 14:24:11,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-02-08 14:24:11,527 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-02-08 14:24:11,528 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:24:11,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2025-02-08 14:24:11,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:24:11,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:11,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:11,528 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:24:11,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:24:11,529 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~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#1(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-02-08 14:24:11,529 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short7#1;" "test_fun_#t~short9#1 := test_fun_#t~short7#1;" "assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 1073741824;" "test_fun_#t~short11#1 := test_fun_#t~short9#1;" "assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1;" "assume test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#1(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-02-08 14:24:11,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1631, now seen corresponding path program 1 times [2025-02-08 14:24:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34936804] [2025-02-08 14:24:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:11,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:11,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:11,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:11,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:11,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:11,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:11,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:11,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:11,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1009401302, now seen corresponding path program 1 times [2025-02-08 14:24:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:11,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050308811] [2025-02-08 14:24:11,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:11,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:11,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:24:11,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:24:11,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:24:11,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:11,617 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:24:11,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:24:11,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050308811] [2025-02-08 14:24:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050308811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:24:11,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:24:11,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:24:11,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821585594] [2025-02-08 14:24:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:24:11,620 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:24:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:24:11,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:24:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:24:11,622 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:24:11,638 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-02-08 14:24:11,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2025-02-08 14:24:11,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:24:11,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2025-02-08 14:24:11,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:24:11,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:24:11,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2025-02-08 14:24:11,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:24:11,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-02-08 14:24:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2025-02-08 14:24:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-02-08 14:24:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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:24:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-02-08 14:24:11,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-08 14:24:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:24:11,642 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-08 14:24:11,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:24:11,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-02-08 14:24:11,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:24:11,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:24:11,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:24:11,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:24:11,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:24:11,643 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~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~tmp#1 := main_#t~nondet15#1, main_#t~nondet16#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~nondet4#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~short11#1, test_fun_#t~mem12#1, test_fun_#t~nondet13#1, test_fun_#t~mem14#1, test_fun_~x#1, test_fun_~tmp#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~tmp#1 := test_fun_#in~tmp#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~tmp#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;call write~int#1(test_fun_#t~nondet4#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet4#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-02-08 14:24:11,643 INFO L754 eck$LassoCheckResult]: Loop: "assume !test_fun_#t~short7#1;" "test_fun_#t~short9#1 := test_fun_#t~short7#1;" "assume !test_fun_#t~short9#1;" "test_fun_#t~short11#1 := test_fun_#t~short9#1;" "assume test_fun_#t~short11#1;call test_fun_#t~mem10#1 := read~int#1(test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);test_fun_#t~short11#1 := test_fun_~x#1 == 2 * test_fun_#t~mem10#1;" "assume test_fun_#t~short11#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~short11#1;call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1;havoc test_fun_#t~nondet13#1;call write~int#1(test_fun_#t~nondet13#1, test_fun_~tmp_ref~0#1.base, test_fun_~tmp_ref~0#1.offset, 4);havoc test_fun_#t~nondet13#1;" "assume true;call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 > 0;" [2025-02-08 14:24:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1631, now seen corresponding path program 2 times [2025-02-08 14:24:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887029845] [2025-02-08 14:24:11,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:24:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:11,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:11,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:11,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:24:11,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:11,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:24:11,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:24:11,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:24:11,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:24:11,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:24:11,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:24:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1010324823, now seen corresponding path program 1 times [2025-02-08 14:24:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:24:11,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887381806] [2025-02-08 14:24:11,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:24:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:24:11,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:24:11,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:24:11,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:24:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:24:11,693 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:24:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:24:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887381806] [2025-02-08 14:24:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887381806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:24:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:24:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:24:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012555011] [2025-02-08 14:24:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:24:11,694 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:24:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:24:11,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:24:11,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:24:11,694 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:24:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:24:11,713 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-02-08 14:24:11,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2025-02-08 14:24:11,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:24:11,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2025-02-08 14:24:11,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:24:11,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:24:11,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:24:11,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:24:11,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:24:11,714 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:24:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:24:11,715 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:24:11,715 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:24:11,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:24:11,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:24:11,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:24:11,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:24:11 BoogieIcfgContainer [2025-02-08 14:24:11,729 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:24:11,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:24:11,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:24:11,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:24:11,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:24:09" (3/4) ... [2025-02-08 14:24:11,732 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:24:11,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:24:11,733 INFO L158 Benchmark]: Toolchain (without parser) took 2725.45ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 89.4MB in the end (delta: 20.6MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-02-08 14:24:11,733 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:11,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.00ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 93.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:24:11,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.94ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:11,734 INFO L158 Benchmark]: Boogie Preprocessor took 20.24ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:11,734 INFO L158 Benchmark]: IcfgBuilder took 237.17ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 76.9MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:24:11,734 INFO L158 Benchmark]: BuchiAutomizer took 2159.39ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 89.4MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:11,734 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 89.4MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:24:11,735 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.00ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 93.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.94ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.24ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 237.17ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 76.9MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2159.39ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 89.4MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 89.4MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 26 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax109 hnf100 lsp90 ukn75 mio100 lsp30 div100 bol100 ite100 ukn100 eq195 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:24:11,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE