./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/trex04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed 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/loops/trex04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash f70ffe9cd45c37f44e9e780e31340fab45b6a2fb7f7ef23a2d90faf4241229d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:17:18,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:17:18,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:17:18,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:17:18,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:17:18,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:17:18,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:17:18,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:17:18,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:17:18,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:17:18,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:17:18,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:17:18,417 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:17:18,417 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:17:18,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:17:18,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:17:18,420 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:17:18,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:17:18,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:17:18,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:17:18,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:17:18,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:17:18,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:17:18,421 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:17:18,421 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f70ffe9cd45c37f44e9e780e31340fab45b6a2fb7f7ef23a2d90faf4241229d6 [2025-03-09 07:17:18,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:17:18,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:17:18,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:17:18,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:17:18,633 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:17:18,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/trex04.c [2025-03-09 07:17:19,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08e1ff3e/d904b21c156f43cba178f9e01bc03c43/FLAGa0ffa2ba6 [2025-03-09 07:17:20,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:17:20,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/trex04.c [2025-03-09 07:17:20,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08e1ff3e/d904b21c156f43cba178f9e01bc03c43/FLAGa0ffa2ba6 [2025-03-09 07:17:20,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08e1ff3e/d904b21c156f43cba178f9e01bc03c43 [2025-03-09 07:17:20,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:17:20,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:17:20,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:17:20,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:17:20,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:17:20,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339928b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20, skipping insertion in model container [2025-03-09 07:17:20,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:17:20,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:17:20,218 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:17:20,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:17:20,246 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:17:20,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20 WrapperNode [2025-03-09 07:17:20,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:17:20,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:17:20,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:17:20,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:17:20,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,278 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 82 [2025-03-09 07:17:20,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:17:20,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:17:20,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:17:20,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:17:20,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:17:20,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:17:20,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:17:20,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:17:20,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:17:20,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (1/1) ... [2025-03-09 07:17:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:20,341 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-09 07:17:20,344 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-09 07:17:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:17:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:17:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:17:20,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:17:20,407 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:17:20,408 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:17:20,575 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-09 07:17:20,575 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:17:20,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:17:20,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:17:20,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:17:20 BoogieIcfgContainer [2025-03-09 07:17:20,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:17:20,582 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:17:20,583 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:17:20,586 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:17:20,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:17:20,587 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:17:20" (1/3) ... [2025-03-09 07:17:20,588 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1480862f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:17:20, skipping insertion in model container [2025-03-09 07:17:20,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:17:20,588 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:20" (2/3) ... [2025-03-09 07:17:20,588 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1480862f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:17:20, skipping insertion in model container [2025-03-09 07:17:20,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:17:20,589 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:17:20" (3/3) ... [2025-03-09 07:17:20,590 INFO L363 chiAutomizerObserver]: Analyzing ICFG trex04.c [2025-03-09 07:17:20,624 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:17:20,625 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:17:20,625 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:17:20,625 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:17:20,625 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:17:20,625 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:17:20,625 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:17:20,626 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:17:20,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 07:17:20,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 07:17:20,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:20,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:20,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:20,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:20,646 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:17:20,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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-09 07:17:20,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 07:17:20,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:20,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:20,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:20,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:20,654 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~d~0#1, main_~x~0#1, main_~c1~1#1, main_~c2~1#1;main_~d~0#1 := 1;havoc main_#t~nondet8#1;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !!(main_~x~0#1 <= 1000000 && main_~x~0#1 >= -1000000);havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;main_~c1~1#1 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;main_~c2~1#1 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;" "assume !(0 != main_~c1~1#1 % 256);" "assume !(0 != main_~c2~1#1 % 256);" "havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;main_~c1~1#1 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;main_~c2~1#1 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;" "assume !(0 != main_~c1~1#1 % 256);" "assume !(0 != main_~c2~1#1 % 256);" [2025-03-09 07:17:20,655 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_~x~0#1 := main_~x~0#1 - main_~d~0#1;" [2025-03-09 07:17:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1778202989, now seen corresponding path program 1 times [2025-03-09 07:17:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805978757] [2025-03-09 07:17:20,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:20,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:20,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:20,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:20,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:20,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:20,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:20,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:20,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:20,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-09 07:17:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942302412] [2025-03-09 07:17:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:20,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:20,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:20,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:20,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:20,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:20,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:20,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:20,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:20,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:20,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -710282181, now seen corresponding path program 1 times [2025-03-09 07:17:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:20,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166734329] [2025-03-09 07:17:20,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:20,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:17:20,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:17:20,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:20,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:20,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:20,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:17:20,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:17:20,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:20,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:21,276 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:21,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:21,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:21,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:21,278 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:21,278 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,278 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:21,278 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:21,278 INFO L132 ssoRankerPreferences]: Filename of dumped script: trex04.c_Iteration1_Lasso [2025-03-09 07:17:21,278 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:21,279 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:21,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,493 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:21,496 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:21,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,499 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-09 07:17:21,500 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-09 07:17:21,501 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-09 07:17:21,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:21,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:21,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,531 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-09 07:17:21,532 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-09 07:17:21,533 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-09 07:17:21,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:21,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:21,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:17:21,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,560 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-09 07:17:21,561 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-09 07:17:21,562 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-09 07:17:21,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:21,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:21,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:21,589 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 07:17:21,594 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-09 07:17:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,598 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-09 07:17:21,599 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-09 07:17:21,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:21,613 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 07:17:21,613 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:21,613 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [1*ULTIMATE.start_main_~d~0#1 - 1 >= 0] [2025-03-09 07:17:21,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:21,627 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-03-09 07:17:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:21,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:21,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:17:21,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:21,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:21,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:21,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:21,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:21,735 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-09 07:17:21,755 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-09 07:17:21,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:21,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 72 transitions. Complement of second has 6 states. [2025-03-09 07:17:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 0 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-03-09 07:17:21,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 1 letters. [2025-03-09 07:17:21,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:21,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 9 letters. Loop has 1 letters. [2025-03-09 07:17:21,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:21,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-09 07:17:21,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:21,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2025-03-09 07:17:21,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-03-09 07:17:21,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 28 states and 42 transitions. [2025-03-09 07:17:21,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-09 07:17:21,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 07:17:21,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2025-03-09 07:17:21,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:21,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-09 07:17:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2025-03-09 07:17:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-09 07:17:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2025-03-09 07:17:21,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 39 transitions. [2025-03-09 07:17:21,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 39 transitions. [2025-03-09 07:17:21,864 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:17:21,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 39 transitions. [2025-03-09 07:17:21,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-03-09 07:17:21,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:21,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:21,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:21,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:21,866 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~d~0#1, main_~x~0#1, main_~c1~1#1, main_~c2~1#1;main_~d~0#1 := 1;havoc main_#t~nondet8#1;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !!(main_~x~0#1 <= 1000000 && main_~x~0#1 >= -1000000);havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;main_~c1~1#1 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;assume 0 == main_#t~nondet10#1 || 1 == main_#t~nondet10#1;main_~c2~1#1 := (if 0 == main_#t~nondet10#1 % 256 then 0 else 1);havoc main_#t~nondet10#1;" "assume 0 != main_~c1~1#1 % 256;main_~d~0#1 := main_~d~0#1 - 1;" "assume !(0 != main_~c2~1#1 % 256);" "havoc main_#t~nondet11#1;assume 0 == main_#t~nondet11#1 || 1 == main_#t~nondet11#1;main_~c1~1#1 := (if 0 == main_#t~nondet11#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;main_~c2~1#1 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;" "assume !(0 != main_~c1~1#1 % 256);" "assume !(0 != main_~c2~1#1 % 256);" [2025-03-09 07:17:21,866 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_~x~0#1 := main_~x~0#1 - main_~d~0#1;" [2025-03-09 07:17:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1777279468, now seen corresponding path program 1 times [2025-03-09 07:17:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569962816] [2025-03-09 07:17:21,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:21,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:21,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:21,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:21,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:21,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:21,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:21,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:21,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-03-09 07:17:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006200894] [2025-03-09 07:17:21,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:21,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:21,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:21,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:21,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:21,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:21,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:21,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:21,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:21,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash -738911332, now seen corresponding path program 1 times [2025-03-09 07:17:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279187929] [2025-03-09 07:17:21,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:21,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:17:21,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:17:21,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:21,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:21,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:17:21,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:17:21,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:21,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:21,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:22,177 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-09 07:17:22,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:22,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:22,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:22,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:22,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:17:22,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:17:22,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:22,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:17:22 BoogieIcfgContainer [2025-03-09 07:17:22,256 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:17:22,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:17:22,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:17:22,256 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:17:22,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:17:20" (3/4) ... [2025-03-09 07:17:22,258 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:17:22,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:17:22,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:17:22,284 INFO L158 Benchmark]: Toolchain (without parser) took 2223.44ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.9MB in the end (delta: 11.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2025-03-09 07:17:22,285 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:22,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.77ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 101.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:17:22,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.00ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:22,287 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 976.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:22,288 INFO L158 Benchmark]: IcfgBuilder took 265.30ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 85.8MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:17:22,288 INFO L158 Benchmark]: BuchiAutomizer took 1673.42ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 105.4MB in the end (delta: -19.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:17:22,288 INFO L158 Benchmark]: Witness Printer took 27.49ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 101.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:17:22,289 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.77ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 101.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.00ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 976.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.30ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 85.8MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1673.42ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 105.4MB in the end (delta: -19.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 27.49ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 101.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function x and consists of 5 locations. The remainder module has 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 45 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital73 mio100 ax100 hnf100 lsp30 ukn95 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L29] int d = 1; [L30] int x = __VERIFIER_nondet_int(); [L31] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L32] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L32] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L34] COND TRUE \read(c1) [L34] d = d - 1 VAL [c2=0, d=0, x=1] [L35] COND FALSE !(\read(c2)) VAL [d=0, x=1] [L37] c1=__VERIFIER_nondet_bool() [L37] c2=__VERIFIER_nondet_bool() [L39] COND FALSE !(\read(c1)) VAL [c2=0, d=0, x=1] [L40] COND FALSE !(\read(c2)) VAL [d=0, x=1] Loop: [L42] COND TRUE x>0 [L44] x=x-d End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L29] int d = 1; [L30] int x = __VERIFIER_nondet_int(); [L31] COND FALSE !(!(x <= 1000000 && x >= -1000000)) [L32] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L32] _Bool c1=__VERIFIER_nondet_bool(), c2=__VERIFIER_nondet_bool(); [L34] COND TRUE \read(c1) [L34] d = d - 1 VAL [c2=0, d=0, x=1] [L35] COND FALSE !(\read(c2)) VAL [d=0, x=1] [L37] c1=__VERIFIER_nondet_bool() [L37] c2=__VERIFIER_nondet_bool() [L39] COND FALSE !(\read(c1)) VAL [c2=0, d=0, x=1] [L40] COND FALSE !(\read(c2)) VAL [d=0, x=1] Loop: [L42] COND TRUE x>0 [L44] x=x-d End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 07:17:22,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)