./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/reverse-bits1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-bwb/reverse-bits1.i -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 3e71bbd54e7c2fb1c47dcb82c9eb8e40d9fc6da26d5ad2a71ce148ceb3cd82ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:49:56,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:49:57,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:49:57,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:49:57,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:49:57,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:49:57,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:49:57,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:49:57,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:49:57,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:49:57,068 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:49:57,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:49:57,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:49:57,068 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:49:57,069 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:49:57,069 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:49:57,069 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:49:57,069 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:49:57,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:49:57,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:49:57,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:49:57,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:49:57,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:49:57,071 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:49:57,071 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 -> 3e71bbd54e7c2fb1c47dcb82c9eb8e40d9fc6da26d5ad2a71ce148ceb3cd82ca [2025-03-17 19:49:57,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:49:57,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:49:57,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:49:57,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:49:57,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:49:57,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/reverse-bits1.i [2025-03-17 19:49:58,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c212f6e/34d3bf2c276c4e2a9c1da45d3907bd11/FLAG0da148c08 [2025-03-17 19:49:58,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:49:58,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/reverse-bits1.i [2025-03-17 19:49:58,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c212f6e/34d3bf2c276c4e2a9c1da45d3907bd11/FLAG0da148c08 [2025-03-17 19:49:58,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c212f6e/34d3bf2c276c4e2a9c1da45d3907bd11 [2025-03-17 19:49:58,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:49:58,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:49:58,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:58,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:49:58,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:49:58,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58, skipping insertion in model container [2025-03-17 19:49:58,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:49:58,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:58,837 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:49:58,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:58,858 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:49:58,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58 WrapperNode [2025-03-17 19:49:58,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:58,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:58,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:49:58,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:49:58,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,880 INFO L138 Inliner]: procedures = 5, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-03-17 19:49:58,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:58,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:49:58,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:49:58,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:49:58,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,892 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:49:58,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:49:58,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:49:58,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:49:58,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:49:58,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (1/1) ... [2025-03-17 19:49:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:58,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:58,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:49:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:49:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:49:58,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:49:58,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:49:59,120 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-17 19:49:59,120 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:49:59,141 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:49:59,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:49:59,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:59 BoogieIcfgContainer [2025-03-17 19:49:59,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:49:59,143 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:49:59,143 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:49:59,147 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:49:59,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:59,148 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:49:58" (1/3) ... [2025-03-17 19:49:59,149 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f37db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:59, skipping insertion in model container [2025-03-17 19:49:59,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:59,149 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:58" (2/3) ... [2025-03-17 19:49:59,149 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f37db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:59, skipping insertion in model container [2025-03-17 19:49:59,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:59,150 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:59" (3/3) ... [2025-03-17 19:49:59,151 INFO L363 chiAutomizerObserver]: Analyzing ICFG reverse-bits1.i [2025-03-17 19:49:59,191 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:49:59,191 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:49:59,191 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:49:59,191 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:49:59,191 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:49:59,191 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:49:59,192 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:49:59,192 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:49:59,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 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-17 19:49:59,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:49:59,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:59,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:59,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:59,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:59,212 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:49:59,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 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-17 19:49:59,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:49:59,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:59,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:59,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:59,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:59,218 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;~v~0 := 0;~r~0 := 0;~s~0 := 31;~z~0 := 0;~y~0 := 0;~x~0 := 0;~n~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~bitwise4#1, main_#t~bitwise5#1, main_#t~post6#1, main_#t~bitwise7#1;havoc main_#t~nondet0#1;~v~0 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;~n~0 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;~z~0 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;~x~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1;~r~0 := ~v~0;~y~0 := ~v~0 - 1;" [2025-03-17 19:49:59,219 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 == ~x~0 || 0 == ~v~0 - ~y~0 - 1;main_#t~bitwise4#1 := 0;" "assume 0 != main_#t~bitwise4#1;havoc main_#t~bitwise4#1;~y~0 := 1;" [2025-03-17 19:49:59,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 1 times [2025-03-17 19:49:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693653849] [2025-03-17 19:49:59,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:59,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:59,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:59,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:59,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:59,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 1 times [2025-03-17 19:49:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644726067] [2025-03-17 19:49:59,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:59,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:59,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644726067] [2025-03-17 19:49:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644726067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:59,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:49:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:49:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021908726] [2025-03-17 19:49:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:59,353 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:49:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:49:59,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:49:59,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:49:59,372 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:49:59,400 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2025-03-17 19:49:59,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-03-17 19:49:59,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:49:59,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 12 states and 17 transitions. [2025-03-17 19:49:59,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-17 19:49:59,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-17 19:49:59,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-17 19:49:59,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:49:59,408 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 19:49:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-17 19:49:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-17 19:49:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-17 19:49:59,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 19:49:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:49:59,424 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-17 19:49:59,424 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:49:59,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-17 19:49:59,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 19:49:59,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:59,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:59,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:59,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:49:59,425 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;~v~0 := 0;~r~0 := 0;~s~0 := 31;~z~0 := 0;~y~0 := 0;~x~0 := 0;~n~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~bitwise4#1, main_#t~bitwise5#1, main_#t~post6#1, main_#t~bitwise7#1;havoc main_#t~nondet0#1;~v~0 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;~n~0 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;~z~0 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;~x~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1;~r~0 := ~v~0;~y~0 := ~v~0 - 1;" [2025-03-17 19:49:59,426 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == ~x~0 || 0 == ~v~0 - ~y~0 - 1);" "assume ~x~0 == ~v~0 - ~y~0 - 1;main_#t~bitwise4#1 := ~x~0;" "assume 0 != main_#t~bitwise4#1;havoc main_#t~bitwise4#1;~y~0 := 1;" [2025-03-17 19:49:59,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 2 times [2025-03-17 19:49:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880731225] [2025-03-17 19:49:59,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:49:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:59,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:59,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:49:59,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:59,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:59,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:59,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:59,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash 56472, now seen corresponding path program 1 times [2025-03-17 19:49:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46048740] [2025-03-17 19:49:59,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:59,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:59,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:59,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:59,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:59,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1814141, now seen corresponding path program 1 times [2025-03-17 19:49:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157887958] [2025-03-17 19:49:59,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:59,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:59,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157887958] [2025-03-17 19:49:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157887958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:49:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:49:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051098897] [2025-03-17 19:49:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:49:59,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:49:59,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:49:59,510 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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-17 19:49:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:49:59,518 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2025-03-17 19:49:59,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2025-03-17 19:49:59,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:49:59,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2025-03-17 19:49:59,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:49:59,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:49:59,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-03-17 19:49:59,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:49:59,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-17 19:49:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-03-17 19:49:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:49:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-03-17 19:49:59,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-17 19:49:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:49:59,520 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-17 19:49:59,520 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:49:59,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2025-03-17 19:49:59,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-17 19:49:59,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:59,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:59,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:49:59,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:49:59,521 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;~v~0 := 0;~r~0 := 0;~s~0 := 31;~z~0 := 0;~y~0 := 0;~x~0 := 0;~n~0 := 0;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~bitwise4#1, main_#t~bitwise5#1, main_#t~post6#1, main_#t~bitwise7#1;havoc main_#t~nondet0#1;~v~0 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;~n~0 := main_#t~nondet1#1;havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;~z~0 := main_#t~nondet2#1;havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;~x~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1;~r~0 := ~v~0;~y~0 := ~v~0 - 1;" "assume 0 == ~x~0 || 0 == ~v~0 - ~y~0 - 1;main_#t~bitwise4#1 := 0;" "assume !(0 != main_#t~bitwise4#1);havoc main_#t~bitwise4#1;" "~v~0 := ~v~0 / 2;" [2025-03-17 19:49:59,521 INFO L754 eck$LassoCheckResult]: Loop: "assume ~v~0 > 0;~r~0 := 2 * ~r~0;~z~0 := ~v~0 % 2;" "assume 0 == ~r~0 || ~r~0 == ~z~0;main_#t~bitwise5#1 := ~z~0;" "~r~0 := main_#t~bitwise5#1;havoc main_#t~bitwise5#1;main_#t~post6#1 := ~s~0;~s~0 := main_#t~post6#1 - 1;havoc main_#t~post6#1;~v~0 := ~v~0 / 2;" [2025-03-17 19:49:59,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1809239, now seen corresponding path program 1 times [2025-03-17 19:49:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765151532] [2025-03-17 19:49:59,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:59,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:59,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:59,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:59,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:59,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 45486, now seen corresponding path program 1 times [2025-03-17 19:49:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22725042] [2025-03-17 19:49:59,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:59,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:59,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:59,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:59,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:59,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1935520104, now seen corresponding path program 1 times [2025-03-17 19:49:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243252931] [2025-03-17 19:49:59,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:59,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:49:59,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:49:59,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:59,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:49:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:49:59,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243252931] [2025-03-17 19:49:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243252931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:49:59,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:49:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:49:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219753034] [2025-03-17 19:49:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:49:59,694 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:59,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:59,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:59,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:59,694 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:59,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:59,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:59,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:59,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: reverse-bits1.i_Iteration3_Loop [2025-03-17 19:49:59,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:59,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:59,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,850 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:59,851 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:59,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:59,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:49:59,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:59,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:59,877 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:49:59,877 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~bitwise5#1=0} Honda state: {ULTIMATE.start_main_#t~bitwise5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:49:59,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:49:59,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:59,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:59,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:49:59,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:59,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:59,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:59,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:59,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:59,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:49:59,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:49:59,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:59,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:59,956 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:59,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:59,960 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:59,961 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:59,961 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:59,961 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:59,961 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:59,961 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:59,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:59,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:59,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: reverse-bits1.i_Iteration3_Loop [2025-03-17 19:49:59,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:59,961 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:59,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:59,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:50:00,128 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:50:00,131 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:50:00,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:00,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:50:00,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:50:00,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:50:00,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:50:00,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:50:00,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:50:00,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:50:00,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:50:00,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:50:00,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:50:00,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:50:00,172 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-17 19:50:00,173 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-17 19:50:00,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:50:00,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:50:00,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:50:00,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:50:00,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:50:00,179 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:50:00,179 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:50:00,180 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~v~0) = 1*~v~0 Supporting invariants [] [2025-03-17 19:50:00,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:50:00,188 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:50:00,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:50:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:50:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:50:00,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:00,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:50:00,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:50:00,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:50:00,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:50:00,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:50:00,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:50:00,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:50:00,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:50:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:50:00,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:50:00,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:50:00,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 14 states and 19 transitions. Complement of second has 4 states. [2025-03-17 19:50:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:50:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:50:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-03-17 19:50:00,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 3 letters. [2025-03-17 19:50:00,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:50:00,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-17 19:50:00,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:50:00,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-17 19:50:00,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:50:00,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2025-03-17 19:50:00,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:50:00,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:50:00,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:50:00,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:50:00,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:50:00,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:50:00,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:50:00,288 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:50:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:50:00,288 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:50:00,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:50:00,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:50:00,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:50:00,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:50:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:50:00,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:50:00,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:50:00,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:50:00,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:50:00,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:50:00,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:50:00 BoogieIcfgContainer [2025-03-17 19:50:00,294 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:50:00,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:50:00,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:50:00,295 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:50:00,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:59" (3/4) ... [2025-03-17 19:50:00,296 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:50:00,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:50:00,297 INFO L158 Benchmark]: Toolchain (without parser) took 1583.84ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 83.0MB in the end (delta: 22.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-03-17 19:50:00,297 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 126.1MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:00,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.16ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 95.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:50:00,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.75ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:00,298 INFO L158 Benchmark]: Boogie Preprocessor took 18.62ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.9MB in the end (delta: 876.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:00,298 INFO L158 Benchmark]: IcfgBuilder took 242.10ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:50:00,298 INFO L158 Benchmark]: BuchiAutomizer took 1150.73ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 83.1MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:00,298 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 83.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:50:00,299 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.19ms. Allocated memory is still 201.3MB. Free memory was 126.4MB in the beginning and 126.1MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.16ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 95.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.75ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.62ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.9MB in the end (delta: 876.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 242.10ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1150.73ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 83.1MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 83.0MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function v and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 37 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div442 bol100 ite100 ukn100 eq134 hnf95 smp41 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 48ms VariablesStem: 0 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:50:00,310 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-17 19:50:00,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE