./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/TwoFloatInterv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/TwoFloatInterv.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 619980f24f1306727466f5c616de82a47a9f9fa9949a068930aef8a7aa603b17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:36:35,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:36:35,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:36:35,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:36:35,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:36:35,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:36:35,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:36:35,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:36:35,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:36:35,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:36:35,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:36:35,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:36:35,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:36:35,727 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:36:35,728 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:36:35,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:36:35,728 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:36:35,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:36:35,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:36:35,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:36:35,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:36:35,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:36:35,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:36:35,729 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:36:35,729 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 -> 619980f24f1306727466f5c616de82a47a9f9fa9949a068930aef8a7aa603b17 [2025-03-04 15:36:35,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:36:35,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:36:35,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:36:35,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:36:35,949 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:36:35,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/TwoFloatInterv.c [2025-03-04 15:36:37,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeffe81a/bbf3023a7f3e4ccd9c24c1eeef58b7fa/FLAG1235ad114 [2025-03-04 15:36:37,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:36:37,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/TwoFloatInterv.c [2025-03-04 15:36:37,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeffe81a/bbf3023a7f3e4ccd9c24c1eeef58b7fa/FLAG1235ad114 [2025-03-04 15:36:37,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeffe81a/bbf3023a7f3e4ccd9c24c1eeef58b7fa [2025-03-04 15:36:37,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:36:37,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:36:37,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:37,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:36:37,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:36:37,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd49db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37, skipping insertion in model container [2025-03-04 15:36:37,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:36:37,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:37,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:36:37,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:37,762 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:36:37,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37 WrapperNode [2025-03-04 15:36:37,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:37,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:37,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:36:37,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:36:37,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,780 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 15 [2025-03-04 15:36:37,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:37,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:36:37,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:36:37,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:36:37,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,791 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:36:37,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:36:37,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:36:37,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:36:37,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:36:37,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (1/1) ... [2025-03-04 15:36:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:37,823 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 15:36:37,830 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 15:36:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:36:37,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:36:37,897 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:36:37,898 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:36:37,965 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-04 15:36:37,966 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:36:37,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:36:37,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:36:37,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:37 BoogieIcfgContainer [2025-03-04 15:36:37,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:36:37,974 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:36:37,975 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:36:37,980 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:36:37,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:37,981 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:36:37" (1/3) ... [2025-03-04 15:36:37,982 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c63bb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:37, skipping insertion in model container [2025-03-04 15:36:37,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:37,983 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:37" (2/3) ... [2025-03-04 15:36:37,983 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c63bb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:37, skipping insertion in model container [2025-03-04 15:36:37,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:37,983 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:37" (3/3) ... [2025-03-04 15:36:37,984 INFO L363 chiAutomizerObserver]: Analyzing ICFG TwoFloatInterv.c [2025-03-04 15:36:38,019 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:36:38,019 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:36:38,019 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:36:38,019 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:36:38,019 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:36:38,019 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:36:38,020 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:36:38,020 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:36:38,025 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-04 15:36:38,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:36:38,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:38,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:38,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:38,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:36:38,040 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:36:38,040 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-04 15:36:38,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:36:38,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:38,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:38,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:38,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:36:38,047 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_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-04 15:36:38,048 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0 && main_~i~0#1 < 50;" "assume main_~i~0#1 < 20;main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 > 10;main_~i~0#1 := 1 + main_~i~0#1;" "assume 30 <= main_~i~0#1 && main_~i~0#1 <= 40;main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-04 15:36:38,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 1 times [2025-03-04 15:36:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421732812] [2025-03-04 15:36:38,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:38,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:38,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:38,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:38,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:38,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:38,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1198525, now seen corresponding path program 1 times [2025-03-04 15:36:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248391676] [2025-03-04 15:36:38,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:38,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:38,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:38,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:38,212 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 15:36:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248391676] [2025-03-04 15:36:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248391676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:38,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584865945] [2025-03-04 15:36:38,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:38,216 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:38,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:38,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:38,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:38,235 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 15:36:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:38,285 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2025-03-04 15:36:38,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-04 15:36:38,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-04 15:36:38,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 17 transitions. [2025-03-04 15:36:38,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:36:38,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:36:38,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-03-04 15:36:38,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:38,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 15:36:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-03-04 15:36:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2025-03-04 15:36:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 15:36:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2025-03-04 15:36:38,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:36:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:38,313 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:36:38,314 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:36:38,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2025-03-04 15:36:38,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-04 15:36:38,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:38,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:38,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:38,316 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-04 15:36:38,316 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_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-03-04 15:36:38,316 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 > 0 && main_~i~0#1 < 50;" "assume !(main_~i~0#1 < 20);" "assume main_~i~0#1 > 10;main_~i~0#1 := 1 + main_~i~0#1;" "assume 30 <= main_~i~0#1 && main_~i~0#1 <= 40;main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-04 15:36:38,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 2 times [2025-03-04 15:36:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939002932] [2025-03-04 15:36:38,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:38,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:38,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:38,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:38,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:38,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:38,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:38,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:38,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1199486, now seen corresponding path program 1 times [2025-03-04 15:36:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033914961] [2025-03-04 15:36:38,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:38,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:38,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:38,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:38,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:38,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1211935517, now seen corresponding path program 1 times [2025-03-04 15:36:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496847480] [2025-03-04 15:36:38,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:38,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:38,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:38,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:38,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:38,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:38,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:38,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:38,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:38,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:38,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:38,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:36:38 BoogieIcfgContainer [2025-03-04 15:36:38,427 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:36:38,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:36:38,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:36:38,428 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:36:38,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:37" (3/4) ... [2025-03-04 15:36:38,429 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:36:38,450 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:36:38,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:36:38,451 INFO L158 Benchmark]: Toolchain (without parser) took 823.88ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 55.5MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:36:38,451 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:38,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.24ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 94.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:38,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.93ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 963.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:38,452 INFO L158 Benchmark]: Boogie Preprocessor took 12.07ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.8MB in the end (delta: 978.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:38,452 INFO L158 Benchmark]: IcfgBuilder took 180.14ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 82.8MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:36:38,452 INFO L158 Benchmark]: BuchiAutomizer took 452.33ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 58.6MB in the end (delta: 24.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:36:38,452 INFO L158 Benchmark]: Witness Printer took 23.10ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 55.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:38,453 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.24ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 94.8MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.93ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 963.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.07ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.8MB in the end (delta: 978.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 180.14ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 82.8MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 452.33ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 58.6MB in the end (delta: 24.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 23.10ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 55.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 9 mSDtfsCounter, 31 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: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() Loop: [L9] COND TRUE i > 0 && i < 50 [L10] COND FALSE !(i < 20) [L13] COND TRUE i > 10 [L14] i = i+1 [L16] COND TRUE 30 <= i && i <= 40 [L17] i = i-1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() Loop: [L9] COND TRUE i > 0 && i < 50 [L10] COND FALSE !(i < 20) [L13] COND TRUE i > 10 [L14] i = i+1 [L16] COND TRUE 30 <= i && i <= 40 [L17] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 15:36:38,466 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)