./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9200f4b7c01ae534db411c2832d0714b6eaa58a9d668730c8aeb9497dccadca2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:51:07,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:51:07,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:51:07,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:51:07,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:51:07,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:51:07,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:51:07,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:51:07,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:51:07,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:51:07,719 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:51:07,719 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:51:07,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:51:07,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:51:07,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:51:07,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:51:07,721 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:51:07,721 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/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 -> 9200f4b7c01ae534db411c2832d0714b6eaa58a9d668730c8aeb9497dccadca2 [2025-03-17 19:51:07,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:51:07,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:51:07,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:51:07,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:51:07,956 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:51:07,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops.c [2025-03-17 19:51:09,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e0e6d57/9b70ac27f14a4a81bc377210eed4cfe7/FLAG3bee06dd7 [2025-03-17 19:51:09,344 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:51:09,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-loops.c [2025-03-17 19:51:09,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e0e6d57/9b70ac27f14a4a81bc377210eed4cfe7/FLAG3bee06dd7 [2025-03-17 19:51:09,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9e0e6d57/9b70ac27f14a4a81bc377210eed4cfe7 [2025-03-17 19:51:09,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:51:09,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:51:09,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:51:09,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:51:09,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:51:09,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47254d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09, skipping insertion in model container [2025-03-17 19:51:09,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:51:09,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:51:09,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:51:09,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:51:09,508 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:51:09,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09 WrapperNode [2025-03-17 19:51:09,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:51:09,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:51:09,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:51:09,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:51:09,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,524 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2025-03-17 19:51:09,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:51:09,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:51:09,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:51:09,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:51:09,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,533 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:51:09,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:51:09,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:51:09,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:51:09,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:51:09,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (1/1) ... [2025-03-17 19:51:09,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:09,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:09,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:09,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:51:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:51:09,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:51:09,621 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:51:09,623 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:51:09,675 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-17 19:51:09,675 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:51:09,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:51:09,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:51:09,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:51:09 BoogieIcfgContainer [2025-03-17 19:51:09,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:51:09,682 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:51:09,683 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:51:09,687 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:51:09,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:51:09,688 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:51:09" (1/3) ... [2025-03-17 19:51:09,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a10afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:51:09, skipping insertion in model container [2025-03-17 19:51:09,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:51:09,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:51:09" (2/3) ... [2025-03-17 19:51:09,690 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a10afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:51:09, skipping insertion in model container [2025-03-17 19:51:09,690 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:51:09,690 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:51:09" (3/3) ... [2025-03-17 19:51:09,691 INFO L363 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-loops.c [2025-03-17 19:51:09,733 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:51:09,734 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:51:09,734 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:51:09,734 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:51:09,734 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:51:09,734 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:51:09,735 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:51:09,735 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:51:09,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:09,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:51:09,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:09,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:09,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:51:09,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:51:09,753 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:51:09,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:09,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:51:09,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:09,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:09,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:51:09,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:51:09,760 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~n~0#1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~x~0#1 := main_~n~0#1;" "assume main_~x~0#1 >= 0 && main_~x~0#1 <= 1073741823;" [2025-03-17 19:51:09,761 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume !(main_~y~0#1 < main_~x~0#1);" "main_~x~0#1 := main_~x~0#1 - 1;" [2025-03-17 19:51:09,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2025-03-17 19:51:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215201911] [2025-03-17 19:51:09,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:09,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:51:09,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:51:09,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:09,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:09,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:09,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:51:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:51:09,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:09,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:09,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:09,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash 35713, now seen corresponding path program 1 times [2025-03-17 19:51:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333327740] [2025-03-17 19:51:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:09,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:51:09,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:51:09,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:09,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:09,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:09,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:51:09,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:51:09,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:09,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:09,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:09,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 38108611, now seen corresponding path program 1 times [2025-03-17 19:51:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657442124] [2025-03-17 19:51:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:09,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:51:09,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:51:09,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:09,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:09,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:51:09,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:51:09,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:09,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:09,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:09,933 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:51:09,934 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:51:09,934 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:51:09,934 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:51:09,934 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:51:09,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:09,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:51:09,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:51:09,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops.c_Iteration1_Loop [2025-03-17 19:51:09,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:51:09,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:51:09,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:09,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:09,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:09,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,026 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:51:10,026 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:51:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,030 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:51:10,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:51:10,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:10,053 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:51:10,054 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:51:10,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:51:10,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:51:10,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:51:10,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:10,086 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:51:10,086 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:51:10,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:51:10,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:51:10,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:10,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-17 19:51:10,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:51:10,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:51:10,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:10,131 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:51:10,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,136 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:51:10,137 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:51:10,137 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:51:10,137 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:51:10,137 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:51:10,137 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,137 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:51:10,137 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:51:10,137 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops.c_Iteration1_Loop [2025-03-17 19:51:10,137 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:51:10,137 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:51:10,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,193 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:51:10,196 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:51:10,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:51:10,202 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-03-17 19:51:10,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:10,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:10,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:10,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:10,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:51:10,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:51:10,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:51:10,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:51:10,234 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-03-17 19:51:10,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:10,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:51:10,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:10,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:10,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:10,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:51:10,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:51:10,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:51:10,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:51:10,252 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:51:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:51:10,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:51:10,257 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:51:10,257 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:51:10,258 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 2*ULTIMATE.start_main_~x~0#1 + 1 Supporting invariants [] [2025-03-17 19:51:10,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,265 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:51:10,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:10,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:51:10,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:51:10,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:51:10,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:10,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:51:10,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:51:10,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:10,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:51:10,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:10,359 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:51:10,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:10,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 5 states. [2025-03-17 19:51:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:51:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-17 19:51:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2025-03-17 19:51:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-17 19:51:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:10,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2025-03-17 19:51:10,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:10,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-17 19:51:10,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:10,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 9 states and 13 transitions. [2025-03-17 19:51:10,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-17 19:51:10,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-17 19:51:10,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2025-03-17 19:51:10,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:51:10,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:51:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2025-03-17 19:51:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:51:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-17 19:51:10,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:51:10,438 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-17 19:51:10,438 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:51:10,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-17 19:51:10,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:10,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:10,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:10,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:51:10,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:51:10,439 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~n~0#1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~x~0#1 := main_~n~0#1;" "assume main_~x~0#1 >= 0 && main_~x~0#1 <= 1073741823;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" [2025-03-17 19:51:10,439 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" [2025-03-17 19:51:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1229309, now seen corresponding path program 1 times [2025-03-17 19:51:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:10,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976958049] [2025-03-17 19:51:10,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:10,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:51:10,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:51:10,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:10,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:10,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:51:10,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:51:10,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:10,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:10,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 1 times [2025-03-17 19:51:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355801891] [2025-03-17 19:51:10,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:10,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:10,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:10,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:10,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:10,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:10,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:10,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:10,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:10,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 38108581, now seen corresponding path program 1 times [2025-03-17 19:51:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528572501] [2025-03-17 19:51:10,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:10,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:51:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:51:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:10,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:10,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:51:10,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:51:10,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:10,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:10,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:10,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,554 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:51:10,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:51:10,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:51:10,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:51:10,555 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:51:10,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:51:10,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:51:10,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops.c_Iteration2_Lasso [2025-03-17 19:51:10,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:51:10,555 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:51:10,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:10,617 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:51:10,617 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:51:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,620 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:51:10,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:51:10,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:10,642 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:51:10,642 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:51:10,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,650 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:51:10,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:51:10,653 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:10,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:10,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:10,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:51:10,674 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:51:10,674 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:12,048 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:51:12,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:51:12,076 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:51:12,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:51:12,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:51:12,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:51:12,076 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:51:12,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:51:12,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:51:12,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops.c_Iteration2_Lasso [2025-03-17 19:51:12,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:51:12,076 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:51:12,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,140 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:51:12,140 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:51:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,142 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:51:12,144 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-03-17 19:51:12,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:12,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:12,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:12,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:12,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:51:12,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:51:12,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:51:12,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:51:12,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,166 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:51:12,168 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-03-17 19:51:12,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:12,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:51:12,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:12,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:12,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:12,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:51:12,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:51:12,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:51:12,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:51:12,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:51:12,191 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-03-17 19:51:12,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:12,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:51:12,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:12,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:12,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:12,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:51:12,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:51:12,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:51:12,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:51:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:51:12,211 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-03-17 19:51:12,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:12,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:12,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:12,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:12,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:51:12,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:51:12,237 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:51:12,246 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-17 19:51:12,246 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-03-17 19:51:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,249 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:51:12,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:51:12,263 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:51:12,264 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:51:12,265 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [1*ULTIMATE.start_main_~y~0#1 - 1 >= 0] [2025-03-17 19:51:12,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:51:12,273 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-03-17 19:51:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:51:12,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:51:12,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:12,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:51:12,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:12,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:12,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:12,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:51:12,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:12,317 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-17 19:51:12,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:12,337 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 23 transitions. Complement of second has 4 states. [2025-03-17 19:51:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:51:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-17 19:51:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-03-17 19:51:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-17 19:51:12,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:12,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:51:12,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:12,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-03-17 19:51:12,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:12,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 18 transitions. [2025-03-17 19:51:12,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-17 19:51:12,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-17 19:51:12,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-17 19:51:12,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:51:12,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-17 19:51:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-17 19:51:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-17 19:51:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-03-17 19:51:12,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-17 19:51:12,341 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-03-17 19:51:12,341 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:51:12,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-03-17 19:51:12,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:12,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:12,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:12,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2025-03-17 19:51:12,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:51:12,342 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~n~0#1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~x~0#1 := main_~n~0#1;" "assume main_~x~0#1 >= 0 && main_~x~0#1 <= 1073741823;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" "assume !(main_~y~0#1 < main_~x~0#1);" "main_~x~0#1 := main_~x~0#1 - 1;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" [2025-03-17 19:51:12,342 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" [2025-03-17 19:51:12,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1421401369, now seen corresponding path program 1 times [2025-03-17 19:51:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722470613] [2025-03-17 19:51:12,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:51:12,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:51:12,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:12,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722470613] [2025-03-17 19:51:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722470613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:51:12,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:51:12,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:51:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071751306] [2025-03-17 19:51:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:51:12,377 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:51:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 2 times [2025-03-17 19:51:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705867282] [2025-03-17 19:51:12,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:51:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:12,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:51:12,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:12,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:12,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:51:12,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:51:12,399 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-03-17 19:51:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:12,409 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-03-17 19:51:12,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-03-17 19:51:12,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:12,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2025-03-17 19:51:12,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-17 19:51:12,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-17 19:51:12,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-03-17 19:51:12,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:51:12,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 19:51:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-03-17 19:51:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 19:51:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-17 19:51:12,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-17 19:51:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:51:12,411 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-17 19:51:12,411 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:51:12,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-03-17 19:51:12,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:12,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:12,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:12,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:51:12,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:51:12,412 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~n~0#1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~x~0#1 := main_~n~0#1;" "assume main_~x~0#1 >= 0 && main_~x~0#1 <= 1073741823;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" "assume !(main_~y~0#1 < main_~x~0#1);" "main_~x~0#1 := main_~x~0#1 - 1;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" [2025-03-17 19:51:12,412 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" [2025-03-17 19:51:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1112900801, now seen corresponding path program 1 times [2025-03-17 19:51:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411734447] [2025-03-17 19:51:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:51:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:51:12,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:12,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:51:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411734447] [2025-03-17 19:51:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411734447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:51:12,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093448447] [2025-03-17 19:51:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:51:12,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:51:12,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,488 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 19:51:12,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:51:12,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:51:12,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:12,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:51:12,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:12,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:51:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:12,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093448447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:51:12,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:51:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-17 19:51:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763995424] [2025-03-17 19:51:12,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:51:12,573 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:51:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 3 times [2025-03-17 19:51:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343623629] [2025-03-17 19:51:12,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:51:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:12,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:51:12,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:12,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:12,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:51:12,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:51:12,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:51:12,593 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:51:12,627 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2025-03-17 19:51:12,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2025-03-17 19:51:12,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:12,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 16 transitions. [2025-03-17 19:51:12,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:51:12,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:51:12,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-03-17 19:51:12,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:51:12,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-17 19:51:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-03-17 19:51:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2025-03-17 19:51:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-17 19:51:12,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-17 19:51:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:51:12,629 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-17 19:51:12,629 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:51:12,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-03-17 19:51:12,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-17 19:51:12,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:51:12,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:51:12,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-17 19:51:12,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 19:51:12,631 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1, main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~n~0#1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~x~0#1 := main_~n~0#1;" "assume main_~x~0#1 >= 0 && main_~x~0#1 <= 1073741823;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" "assume !(main_~y~0#1 < main_~x~0#1);" "main_~x~0#1 := main_~x~0#1 - 1;" "assume main_~x~0#1 >= 0;main_~y~0#1 := 1;" "assume main_~y~0#1 < main_~x~0#1;" [2025-03-17 19:51:12,631 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~y~0#1 < main_~x~0#1;main_~y~0#1 := 2 * main_~y~0#1;" [2025-03-17 19:51:12,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 139317785, now seen corresponding path program 2 times [2025-03-17 19:51:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762013876] [2025-03-17 19:51:12,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:51:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:51:12,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:51:12,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:51:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:12,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:51:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:51:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 4 times [2025-03-17 19:51:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865543738] [2025-03-17 19:51:12,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:51:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,649 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-17 19:51:12,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,649 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:51:12,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:12,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:12,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:12,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 23884041, now seen corresponding path program 3 times [2025-03-17 19:51:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:51:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987008028] [2025-03-17 19:51:12,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:51:12,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:51:12,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 3 equivalence classes. [2025-03-17 19:51:12,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:51:12,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:51:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:51:12,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:51:12,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:51:12,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:12,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:51:12,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:51:12,712 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:51:12,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:51:12,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:51:12,712 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:51:12,712 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:51:12,712 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,712 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:51:12,712 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:51:12,712 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops.c_Iteration5_Lasso [2025-03-17 19:51:12,712 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:51:12,712 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:51:12,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:51:12,786 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:51:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,788 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:51:12,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:51:12,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:12,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:12,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,810 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:51:12,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:51:12,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:51:12,860 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:51:12,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:51:12,864 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:51:12,864 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:51:12,864 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:51:12,864 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:51:12,864 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:51:12,864 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,864 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:51:12,864 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:51:12,864 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-loops.c_Iteration5_Lasso [2025-03-17 19:51:12,864 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:51:12,864 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:51:12,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:51:12,934 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:51:12,934 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:51:12,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,936 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:51:12,939 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-03-17 19:51:12,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:51:12,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:51:12,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:51:12,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:51:12,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:51:12,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:51:12,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:51:12,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:12,987 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 19:51:12,987 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:51:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:51:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:51:12,989 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:51:12,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:51:12,992 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:51:13,002 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:51:13,002 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:51:13,002 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [1*ULTIMATE.start_main_~y~0#1 - 1 >= 0] [2025-03-17 19:51:13,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:51:13,010 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-03-17 19:51:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:13,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:51:13,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:51:13,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:13,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:13,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:51:13,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:13,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:13,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:13,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:51:13,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:13,055 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-17 19:51:13,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:13,075 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 18 transitions. Complement of second has 4 states. [2025-03-17 19:51:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:51:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-17 19:51:13,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 1 letters. [2025-03-17 19:51:13,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:13,077 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:51:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:13,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:51:13,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:51:13,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:13,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:13,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:51:13,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:13,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:13,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:13,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:13,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:51:13,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:13,126 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-17 19:51:13,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:13,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 18 transitions. Complement of second has 4 states. [2025-03-17 19:51:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:51:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-17 19:51:13,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 1 letters. [2025-03-17 19:51:13,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:13,141 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:51:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:51:13,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:51:13,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:51:13,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:13,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:13,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:51:13,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:13,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:51:13,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:51:13,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:51:13,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:51:13,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:51:13,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:51:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:51:13,181 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-03-17 19:51:13,182 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:13,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 14 transitions. Complement of second has 3 states. [2025-03-17 19:51:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 19:51:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:51:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-17 19:51:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2025-03-17 19:51:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 1 letters. [2025-03-17 19:51:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:13,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-17 19:51:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:51:13,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2025-03-17 19:51:13,204 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:51:13,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2025-03-17 19:51:13,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:51:13,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:51:13,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:51:13,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:51:13,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:51:13,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:51:13,205 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:51:13,205 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:51:13,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:51:13,205 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:51:13,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:51:13,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:51:13 BoogieIcfgContainer [2025-03-17 19:51:13,212 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:51:13,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:51:13,212 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:51:13,212 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:51:13,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:51:09" (3/4) ... [2025-03-17 19:51:13,214 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:51:13,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:51:13,215 INFO L158 Benchmark]: Toolchain (without parser) took 3846.55ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.0MB in the end (delta: 16.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-17 19:51:13,215 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:51:13,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.40ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 101.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:51:13,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.43ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 100.1MB in the end (delta: 482.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:51:13,216 INFO L158 Benchmark]: Boogie Preprocessor took 10.19ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 963.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:51:13,216 INFO L158 Benchmark]: IcfgBuilder took 145.58ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 89.1MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:51:13,216 INFO L158 Benchmark]: BuchiAutomizer took 3529.76ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 94.8MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:51:13,216 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.0MB in the end (delta: 797.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:51:13,218 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.40ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 101.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.43ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 100.1MB in the end (delta: 482.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.19ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.1MB in the end (delta: 963.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 145.58ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 89.1MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 3529.76ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 94.8MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.0MB in the end (delta: 797.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long) 2 * x) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long) -1 * y) + x) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -1 * y) + x) and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 29 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax168 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf93 smp100 dnf100 smp100 tf103 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:51:13,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:51:13,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 19:51:13,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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