./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/loop-lit/mine2017-ex4.8.i -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 ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:05:20,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:05:20,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:05:20,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:05:20,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:05:20,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:05:20,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:05:20,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:05:20,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:05:20,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:05:20,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:05:20,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:05:20,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:05:20,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:05:20,700 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:05:20,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:05:20,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:05:20,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:05:20,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:05:20,704 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:05:20,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:05:20,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:05:20,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:05:20,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:05:20,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:05:20,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:05:20,705 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:05:20,705 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 -> ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 [2025-03-04 16:05:20,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:05:20,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:05:20,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:05:20,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:05:20,959 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:05:20,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2025-03-04 16:05:22,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff1b9109/df9a63e90df84bf59db7fea69abeb4cb/FLAG51b30d0e9 [2025-03-04 16:05:22,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:05:22,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2025-03-04 16:05:22,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff1b9109/df9a63e90df84bf59db7fea69abeb4cb/FLAG51b30d0e9 [2025-03-04 16:05:22,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff1b9109/df9a63e90df84bf59db7fea69abeb4cb [2025-03-04 16:05:22,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:05:22,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:05:22,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:05:22,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:05:22,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:05:22,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafcea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22, skipping insertion in model container [2025-03-04 16:05:22,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:05:22,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:05:22,445 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:05:22,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:05:22,469 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:05:22,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22 WrapperNode [2025-03-04 16:05:22,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:05:22,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:05:22,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:05:22,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:05:22,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,495 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 36 [2025-03-04 16:05:22,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:05:22,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:05:22,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:05:22,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:05:22,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,517 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-04 16:05:22,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:05:22,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:05:22,527 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:05:22,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:05:22,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (1/1) ... [2025-03-04 16:05:22,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:22,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:22,558 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-04 16:05:22,568 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-04 16:05:22,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:05:22,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:05:22,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:05:22,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:05:22,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:05:22,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:05:22,721 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 16:05:22,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:05:22,728 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:05:22,728 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:05:22,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:22 BoogieIcfgContainer [2025-03-04 16:05:22,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:05:22,729 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:05:22,729 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:05:22,733 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:05:22,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:22,734 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:05:22" (1/3) ... [2025-03-04 16:05:22,735 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fc99bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:05:22, skipping insertion in model container [2025-03-04 16:05:22,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:22,735 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:05:22" (2/3) ... [2025-03-04 16:05:22,735 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fc99bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:05:22, skipping insertion in model container [2025-03-04 16:05:22,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:05:22,735 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:22" (3/3) ... [2025-03-04 16:05:22,736 INFO L363 chiAutomizerObserver]: Analyzing ICFG mine2017-ex4.8.i [2025-03-04 16:05:22,774 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:05:22,775 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:05:22,775 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:05:22,775 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:05:22,775 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:05:22,775 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:05:22,775 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:05:22,775 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:05:22,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:22,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 16:05:22,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:22,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:22,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:22,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:22,795 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:05:22,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:22,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-03-04 16:05:22,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:22,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:22,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 16:05:22,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:22,801 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(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" [2025-03-04 16:05:22,802 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume 0 == main_~v~0#1;main_~v~0#1 := 1;" [2025-03-04 16:05:22,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 1 times [2025-03-04 16:05:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207846058] [2025-03-04 16:05:22,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:22,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:22,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:22,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:22,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:22,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:22,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:22,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:22,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:22,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:22,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:22,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:22,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1327391439, now seen corresponding path program 1 times [2025-03-04 16:05:22,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:22,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073039894] [2025-03-04 16:05:22,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:22,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:22,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:22,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:22,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:22,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:22,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:22,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:22,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:22,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 259477232, now seen corresponding path program 1 times [2025-03-04 16:05:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473790311] [2025-03-04 16:05:22,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:22,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:05:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:05:22,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:22,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:22,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:05:22,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:05:22,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:22,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:22,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:23,053 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:23,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:23,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:23,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:23,054 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 16:05:23,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:23,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:23,055 INFO L132 ssoRankerPreferences]: Filename of dumped script: mine2017-ex4.8.i_Iteration1_Loop [2025-03-04 16:05:23,055 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:23,055 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:23,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,116 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:23,117 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 16:05:23,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,120 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-04 16:05:23,122 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-04 16:05:23,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:23,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:23,138 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:05:23,138 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:05:23,145 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-04 16:05:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,147 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-04 16:05:23,148 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-04 16:05:23,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:23,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:23,161 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:05:23,162 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:05:23,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,170 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-04 16:05:23,171 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-04 16:05:23,173 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:23,173 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:23,185 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 16:05:23,185 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 16:05:23,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 16:05:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,193 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-04 16:05:23,194 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-04 16:05:23,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 16:05:23,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:23,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 16:05:23,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:23,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 16:05:23,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 16:05:23,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 16:05:23,233 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 16:05:23,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 16:05:23,240 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 16:05:23,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 16:05:23,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 16:05:23,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 16:05:23,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 16:05:23,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 16:05:23,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 16:05:23,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: mine2017-ex4.8.i_Iteration1_Loop [2025-03-04 16:05:23,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 16:05:23,240 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 16:05:23,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 16:05:23,279 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 16:05:23,282 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 16:05:23,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,284 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:23,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 16:05:23,288 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-04 16:05:23,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:23,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:23,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:23,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:23,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:23,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:23,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:23,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:05:23,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:23,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:23,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 16:05:23,316 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-04 16:05:23,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:23,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:23,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:23,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:23,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:23,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:23,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:23,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:05:23,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 16:05:23,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:23,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 16:05:23,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 16:05:23,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:23,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:23,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:23,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:23,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:23,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:23,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:23,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 16:05:23,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 16:05:23,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:23,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 16:05:23,361 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-04 16:05:23,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 16:05:23,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 16:05:23,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 16:05:23,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 16:05:23,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 16:05:23,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 16:05:23,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 16:05:23,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 16:05:23,378 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 16:05:23,382 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 16:05:23,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:05:23,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:05:23,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:05:23,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 16:05:23,387 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 16:05:23,387 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 16:05:23,387 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 16:05:23,388 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v~0#1) = -2*ULTIMATE.start_main_~v~0#1 + 1 Supporting invariants [] [2025-03-04 16:05:23,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 16:05:23,396 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 16:05:23,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 16:05:23,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 16:05:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:23,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 16:05:23,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:23,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:23,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:23,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 16:05:23,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:05:23,491 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-04 16:05:23,508 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 16:05:23,510 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-04 16:05:23,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 67 transitions. Complement of second has 6 states. [2025-03-04 16:05:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 16:05:23,544 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-04 16:05:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-03-04 16:05:23,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 7 letters. [2025-03-04 16:05:23,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:23,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 9 letters. Loop has 7 letters. [2025-03-04 16:05:23,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:23,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 14 letters. [2025-03-04 16:05:23,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 16:05:23,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 67 transitions. [2025-03-04 16:05:23,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:23,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 22 transitions. [2025-03-04 16:05:23,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 16:05:23,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 16:05:23,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2025-03-04 16:05:23,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:23,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-04 16:05:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2025-03-04 16:05:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-04 16:05:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-04 16:05:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-04 16:05:23,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-04 16:05:23,571 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-04 16:05:23,571 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:05:23,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2025-03-04 16:05:23,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:23,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:23,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:23,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:05:23,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:23,572 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(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" "assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-03-04 16:05:23,572 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(0 == main_~v~0#1);" "assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-03-04 16:05:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 55575, now seen corresponding path program 1 times [2025-03-04 16:05:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357266705] [2025-03-04 16:05:23,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:23,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:05:23,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:05:23,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:23,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:05:23,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:05:23,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:23,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash 319794460, now seen corresponding path program 1 times [2025-03-04 16:05:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:23,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175583567] [2025-03-04 16:05:23,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:23,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:23,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:23,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:23,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:23,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:23,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash -546140346, now seen corresponding path program 1 times [2025-03-04 16:05:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163315213] [2025-03-04 16:05:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:23,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:23,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:23,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:05:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:05:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:05:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163315213] [2025-03-04 16:05:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163315213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:05:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:05:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:05:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446381363] [2025-03-04 16:05:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:05:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:05:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:05:23,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:05:23,729 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:05:23,740 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-04 16:05:23,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2025-03-04 16:05:23,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:23,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2025-03-04 16:05:23,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 16:05:23,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 16:05:23,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2025-03-04 16:05:23,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 16:05:23,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-04 16:05:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2025-03-04 16:05:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 16:05:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 16:05:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-04 16:05:23,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-04 16:05:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:05:23,743 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-04 16:05:23,743 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:05:23,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2025-03-04 16:05:23,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 16:05:23,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:05:23,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:05:23,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:23,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:05:23,744 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(22, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0;" "assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume 0 == main_~v~0#1;main_~v~0#1 := 1;" "assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-03-04 16:05:23,745 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296);havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;" "assume !(0 == main_~v~0#1);" "assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1;" [2025-03-04 16:05:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash -546140377, now seen corresponding path program 2 times [2025-03-04 16:05:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028988406] [2025-03-04 16:05:23,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:23,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 16:05:23,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:23,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:05:23,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:23,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:23,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:23,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:23,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,769 INFO L85 PathProgramCache]: Analyzing trace with hash 319794460, now seen corresponding path program 2 times [2025-03-04 16:05:23,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-04 16:05:23,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:05:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:23,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:23,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:23,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:05:23,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:23,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:05:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:05:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:05:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2099583178, now seen corresponding path program 1 times [2025-03-04 16:05:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:05:23,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-04 16:05:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:05:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:05:23,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:05:23,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:05:23,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:23,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 16:05:23,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 16:05:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:23,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:05:23,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 16:05:24,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:24,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:24,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:24,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:05:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 16:05:24,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 16:05:24,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:05:24,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:05:24,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:05:24 BoogieIcfgContainer [2025-03-04 16:05:24,076 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:05:24,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:05:24,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:05:24,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:05:24,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:05:22" (3/4) ... [2025-03-04 16:05:24,080 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 16:05:24,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 16:05:24,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:05:24,109 INFO L158 Benchmark]: Toolchain (without parser) took 1805.00ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 91.7MB in the end (delta: 30.3MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-03-04 16:05:24,109 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:24,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.00ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 111.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:05:24,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.20ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.7MB in the end (delta: 905.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:24,110 INFO L158 Benchmark]: Boogie Preprocessor took 30.07ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:24,110 INFO L158 Benchmark]: IcfgBuilder took 201.61ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 99.6MB in the end (delta: 9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:05:24,110 INFO L158 Benchmark]: BuchiAutomizer took 1346.95ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 95.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:05:24,110 INFO L158 Benchmark]: Witness Printer took 31.79ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 91.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:05:24,112 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.12ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.00ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 111.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.20ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 110.7MB in the end (delta: 905.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.07ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 201.61ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 99.6MB in the end (delta: 9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1346.95ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 95.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 31.79ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 91.7MB in the end (delta: 3.3MB). 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -2 * v) + 1) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 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, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 20 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) [L17] COND TRUE __VERIFIER_nondet_bool() == 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) [L17] COND TRUE __VERIFIER_nondet_bool() == 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 16:05:24,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)