./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/and-03-false.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-bwb/and-03-false.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 cfd67d5631b4948a1522f37c4b686fa068a561ee1d767737058a32ed6cf067a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:49:43,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:49:43,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:49:43,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:49:43,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:49:43,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:49:43,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:49:43,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:49:43,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:49:43,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:49:43,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:49:43,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:49:43,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:49:43,187 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:49:43,187 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:49:43,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:49:43,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:49:43,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:49:43,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:49:43,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:49:43,190 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:49:43,190 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 -> cfd67d5631b4948a1522f37c4b686fa068a561ee1d767737058a32ed6cf067a0 [2025-03-17 19:49:43,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:49:43,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:49:43,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:49:43,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:49:43,450 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:49:43,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/and-03-false.c [2025-03-17 19:49:44,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe802541/fc34ae061a584e6ea708747f0729d178/FLAG304fe697b [2025-03-17 19:49:44,748 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:49:44,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/and-03-false.c [2025-03-17 19:49:44,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe802541/fc34ae061a584e6ea708747f0729d178/FLAG304fe697b [2025-03-17 19:49:45,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe802541/fc34ae061a584e6ea708747f0729d178 [2025-03-17 19:49:45,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:49:45,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:49:45,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:45,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:49:45,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:49:45,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e597254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45, skipping insertion in model container [2025-03-17 19:49:45,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:49:45,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:45,204 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:49:45,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:45,223 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:49:45,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45 WrapperNode [2025-03-17 19:49:45,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:45,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:45,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:49:45,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:49:45,229 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:49:45" (1/1) ... [2025-03-17 19:49:45,232 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:49:45" (1/1) ... [2025-03-17 19:49:45,245 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-03-17 19:49:45,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:45,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:49:45,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:49:45,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:49:45,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,257 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:49:45,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:49:45,263 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:49:45,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:49:45,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:49:45,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (1/1) ... [2025-03-17 19:49:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:45,291 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:49:45,296 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:49:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:49:45,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:49:45,348 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:49:45,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:49:45,431 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-17 19:49:45,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:49:45,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:49:45,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:49:45,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:45 BoogieIcfgContainer [2025-03-17 19:49:45,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:49:45,443 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:49:45,443 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:49:45,449 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:49:45,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:45,450 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:49:45" (1/3) ... [2025-03-17 19:49:45,451 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f4e3541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:45, skipping insertion in model container [2025-03-17 19:49:45,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:45,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:45" (2/3) ... [2025-03-17 19:49:45,451 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f4e3541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:45, skipping insertion in model container [2025-03-17 19:49:45,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:45,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:45" (3/3) ... [2025-03-17 19:49:45,452 INFO L363 chiAutomizerObserver]: Analyzing ICFG and-03-false.c [2025-03-17 19:49:45,490 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:49:45,491 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:49:45,491 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:49:45,491 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:49:45,491 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:49:45,491 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:49:45,491 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:49:45,491 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:49:45,495 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:49:45,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:45,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:45,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:45,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:45,511 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:49:45,511 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:49:45,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:45,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:45,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:45,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:45,517 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-17 19:49:45,518 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~x~0#1;" "assume !(main_~x~0#1 >= 0);main_#t~post2#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-03-17 19:49:45,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2025-03-17 19:49:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728889184] [2025-03-17 19:49:45,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2025-03-17 19:49:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972506422] [2025-03-17 19:49:45,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:45,639 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:49:45,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:45,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972506422] [2025-03-17 19:49:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972506422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:45,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:49:45,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:49:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9264515] [2025-03-17 19:49:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:45,645 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:49:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:49:45,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:49:45,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:49:45,667 INFO L87 Difference]: Start difference. 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:49:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:49:45,681 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2025-03-17 19:49:45,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2025-03-17 19:49:45,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 7 states and 8 transitions. [2025-03-17 19:49:45,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-17 19:49:45,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-17 19:49:45,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-03-17 19:49:45,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:49:45,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 19:49:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-03-17 19:49:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 19:49:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-03-17 19:49:45,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 19:49:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:49:45,713 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-17 19:49:45,715 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:49:45,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-03-17 19:49:45,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-17 19:49:45,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:45,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:45,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:45,716 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:49:45,716 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~bitwise1#1, main_#t~post2#1, main_~x~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-17 19:49:45,716 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == main_~x~0#1;" "assume main_~x~0#1 >= 0;" "assume 0 == main_~x~0#1 || 0 == main_~x~0#1 - 1;main_#t~bitwise1#1 := 0;" "main_~x~0#1 := main_#t~bitwise1#1;havoc main_#t~bitwise1#1;" [2025-03-17 19:49:45,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 2 times [2025-03-17 19:49:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127385927] [2025-03-17 19:49:45,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:49:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:49:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1230143, now seen corresponding path program 1 times [2025-03-17 19:49:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350533204] [2025-03-17 19:49:45,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:45,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:45,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:45,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:45,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 39094504, now seen corresponding path program 1 times [2025-03-17 19:49:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934993423] [2025-03-17 19:49:45,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:45,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:49:45,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:49:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:49:45,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:49:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:45,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:45,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:45,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:45,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:45,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:45,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:49:45 BoogieIcfgContainer [2025-03-17 19:49:45,851 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:49:45,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:49:45,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:49:45,852 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:49:45,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:45" (3/4) ... [2025-03-17 19:49:45,854 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 19:49:45,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:49:45,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:49:45,882 INFO L158 Benchmark]: Toolchain (without parser) took 780.30ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 68.0MB in the end (delta: 46.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 19:49:45,882 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:45,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 122.43ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 104.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:49:45,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.42ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 103.5MB in the end (delta: 984.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:45,883 INFO L158 Benchmark]: Boogie Preprocessor took 16.48ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.6MB in the end (delta: 932.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:45,883 INFO L158 Benchmark]: IcfgBuilder took 179.92ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 92.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:49:45,883 INFO L158 Benchmark]: BuchiAutomizer took 408.13ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 71.0MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 19:49:45,883 INFO L158 Benchmark]: Witness Printer took 28.19ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 68.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:45,884 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.17ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 122.43ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 104.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.42ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 103.5MB in the end (delta: 984.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.48ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.6MB in the end (delta: 932.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 179.92ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 92.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 408.13ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 71.0MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 28.19ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 68.0MB in the end (delta: 3.0MB). 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 6 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 14]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L12] int x; [L13] x = __VERIFIER_nondet_int() Loop: [L14] COND TRUE x==0 [L16] COND TRUE x >= 0 [L17] EXPR x&(x-1) [L17] x = x&(x-1) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L12] int x; [L13] x = __VERIFIER_nondet_int() Loop: [L14] COND TRUE x==0 [L16] COND TRUE x >= 0 [L17] EXPR x&(x-1) [L17] x = x&(x-1) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 19:49:45,896 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)