./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 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-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-?-798a7b3-m [2025-03-04 15:33:31,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:33:31,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:33:31,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:33:31,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:33:31,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:33:31,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:33:31,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:33:31,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:33:31,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:33:31,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:33:31,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:33:31,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:33:31,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:33:31,589 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:33:31,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:33:31,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:33:31,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:33:31,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:33:31,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:33:31,591 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:33:31,591 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-04 15:33:31,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:33:31,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:33:31,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:33:31,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:33:31,832 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:33:31,833 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-04 15:33:32,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9580fbe67/c4bdf4e37b52499b9b861cdee19b87da/FLAGbd5d6458a [2025-03-04 15:33:33,150 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:33:33,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/reverse-bits1.i [2025-03-04 15:33:33,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9580fbe67/c4bdf4e37b52499b9b861cdee19b87da/FLAGbd5d6458a [2025-03-04 15:33:33,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9580fbe67/c4bdf4e37b52499b9b861cdee19b87da [2025-03-04 15:33:33,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:33:33,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:33:33,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:33,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:33:33,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:33:33,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422618f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33, skipping insertion in model container [2025-03-04 15:33:33,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:33:33,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:33,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:33:33,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:33:33,626 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:33:33,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33 WrapperNode [2025-03-04 15:33:33,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:33:33,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:33,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:33:33,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:33:33,632 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:33:33" (1/1) ... [2025-03-04 15:33:33,634 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:33:33" (1/1) ... [2025-03-04 15:33:33,646 INFO L138 Inliner]: procedures = 5, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-03-04 15:33:33,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:33:33,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:33:33,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:33:33,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:33:33,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,662 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:33:33,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:33:33,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:33:33,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:33:33,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:33:33,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (1/1) ... [2025-03-04 15:33:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:33,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:33,702 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:33:33,708 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:33:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:33:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:33:33,765 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:33:33,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:33:33,900 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-04 15:33:33,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:33:33,914 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:33:33,914 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:33:33,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:33 BoogieIcfgContainer [2025-03-04 15:33:33,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:33:33,916 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:33:33,916 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:33:33,923 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:33:33,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:33,924 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:33:33" (1/3) ... [2025-03-04 15:33:33,924 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5733f063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:33, skipping insertion in model container [2025-03-04 15:33:33,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:33,924 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:33:33" (2/3) ... [2025-03-04 15:33:33,924 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5733f063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:33:33, skipping insertion in model container [2025-03-04 15:33:33,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:33:33,925 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:33" (3/3) ... [2025-03-04 15:33:33,925 INFO L363 chiAutomizerObserver]: Analyzing ICFG reverse-bits1.i [2025-03-04 15:33:33,960 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:33:33,960 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:33:33,960 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:33:33,960 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:33:33,960 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:33:33,960 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:33:33,960 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:33:33,960 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:33:33,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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:33:33,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 15:33:33,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:33,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:33,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:33,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:33,979 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:33:33,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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:33:33,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 15:33:33,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:33,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:33,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:33,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:33:33,988 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-04 15:33:33,989 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-04 15:33:33,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 1 times [2025-03-04 15:33:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620446465] [2025-03-04 15:33:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:34,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:34,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:34,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:34,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:34,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:34,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2025-03-04 15:33:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778343825] [2025-03-04 15:33:34,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:34,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:34,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,135 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:33:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778343825] [2025-03-04 15:33:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778343825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:33:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31151098] [2025-03-04 15:33:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:34,140 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:33:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:34,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:33:34,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:33:34,157 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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-04 15:33:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:34,179 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2025-03-04 15:33:34,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2025-03-04 15:33:34,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 15:33:34,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 18 transitions. [2025-03-04 15:33:34,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-04 15:33:34,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:33:34,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-03-04 15:33:34,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:34,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:33:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-03-04 15:33:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 15:33:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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:33:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-04 15:33:34,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:33:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:33:34,204 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-04 15:33:34,204 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:33:34,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-03-04 15:33:34,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-04 15:33:34,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:34,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:34,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:33:34,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:34,204 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-04 15:33:34,204 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-04 15:33:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 2 times [2025-03-04 15:33:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419169645] [2025-03-04 15:33:34,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:33:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:34,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:34,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:33:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:34,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:33:34,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:33:34,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:34,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 58458, now seen corresponding path program 1 times [2025-03-04 15:33:34,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275916899] [2025-03-04 15:33:34,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:34,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:34,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:34,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:34,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:34,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash 59134011, now seen corresponding path program 1 times [2025-03-04 15:33:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442107652] [2025-03-04 15:33:34,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:34,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:34,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,258 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:33:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442107652] [2025-03-04 15:33:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442107652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:33:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599396380] [2025-03-04 15:33:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:34,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:33:34,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:33:34,310 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:33:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:34,323 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2025-03-04 15:33:34,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2025-03-04 15:33:34,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:34,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2025-03-04 15:33:34,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-04 15:33:34,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-04 15:33:34,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2025-03-04 15:33:34,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:34,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-04 15:33:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2025-03-04 15:33:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-04 15:33:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:33:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-04 15:33:34,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-04 15:33:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:33:34,326 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-04 15:33:34,326 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:33:34,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2025-03-04 15:33:34,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:33:34,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:33:34,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:33:34,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:33:34,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:33:34,328 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-04 15:33:34,328 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-04 15:33:34,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash 59129109, now seen corresponding path program 1 times [2025-03-04 15:33:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110799279] [2025-03-04 15:33:34,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:34,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:34,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:34,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:34,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:34,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash 47472, now seen corresponding path program 1 times [2025-03-04 15:33:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320869246] [2025-03-04 15:33:34,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:34,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:34,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:33:34,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:34,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:34,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:33:34,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:33:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:34,367 INFO L85 PathProgramCache]: Analyzing trace with hash 578712540, now seen corresponding path program 1 times [2025-03-04 15:33:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:33:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701998551] [2025-03-04 15:33:34,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:33:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:33:34,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:33:34,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:33:34,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:34,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:34,479 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:33:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:33:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701998551] [2025-03-04 15:33:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701998551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:33:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:33:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:33:34,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198055841] [2025-03-04 15:33:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:33:34,576 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:34,577 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:34,577 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:34,577 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:34,577 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:33:34,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:34,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:34,578 INFO L132 ssoRankerPreferences]: Filename of dumped script: reverse-bits1.i_Iteration3_Loop [2025-03-04 15:33:34,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:34,580 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:34,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,720 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:34,721 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:33:34,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:33:34,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:34,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:34,739 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:33:34,739 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-04 15:33:34,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:34,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:33:34,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:33:34,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:34,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:33:34,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:33:34,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:33:34,827 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:33:34,832 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-04 15:33:34,833 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:33:34,833 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:33:34,834 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:33:34,834 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:33:34,834 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:33:34,834 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,834 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:33:34,834 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:33:34,834 INFO L132 ssoRankerPreferences]: Filename of dumped script: reverse-bits1.i_Iteration3_Loop [2025-03-04 15:33:34,834 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:33:34,834 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:33:34,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:33:34,946 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:33:34,949 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:33:34,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,951 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:33:34,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:33:34,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:33:34,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:33:34,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:33:34,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:33:34,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:33:34,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:33:34,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:33:34,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:33:34,979 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-03-04 15:33:34,981 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-03-04 15:33:34,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:33:34,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:33:34,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:33:34,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:33:34,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:33:34,991 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:33:34,992 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:33:34,992 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~v~0) = 1*~v~0 Supporting invariants [] [2025-03-04 15:33:34,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:33:35,000 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:33:35,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:33:35,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:33:35,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:33:35,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:33:35,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:35,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:33:35,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:33:35,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:33:35,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:33:35,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:33:35,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:33:35,065 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:33:35,068 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-04 15:33:35,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 20 transitions. Complement of second has 4 states. [2025-03-04 15:33:35,097 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-04 15:33:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 15:33:35,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 15:33:35,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:35,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-04 15:33:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:35,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-04 15:33:35,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:33:35,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-03-04 15:33:35,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:35,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2025-03-04 15:33:35,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:33:35,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:33:35,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:33:35,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:35,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:35,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:33:35,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:33:35,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:33:35,107 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:33:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:33:35,107 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-04 15:33:35,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-04 15:33:35,108 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:35,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 15:33:35,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:33:35,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:33:35,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:33:35,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:33:35,108 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:35,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:33:35,108 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:33:35,109 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:33:35,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:33:35,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:33:35,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:33:35,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:33:35 BoogieIcfgContainer [2025-03-04 15:33:35,117 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:33:35,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:33:35,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:33:35,118 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:33:35,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:33:33" (3/4) ... [2025-03-04 15:33:35,120 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:33:35,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:33:35,121 INFO L158 Benchmark]: Toolchain (without parser) took 1604.20ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 80.9MB in the end (delta: 24.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:35,121 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:35,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 109.47ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:33:35,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.74ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:35,122 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.5MB in the end (delta: 246.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:35,123 INFO L158 Benchmark]: IcfgBuilder took 245.28ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 79.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:33:35,123 INFO L158 Benchmark]: BuchiAutomizer took 1201.29ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 81.0MB in the end (delta: -1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:35,123 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 80.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:33:35,124 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 109.47ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.7MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.74ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.5MB in the end (delta: 246.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 245.28ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 79.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1201.29ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 81.0MB in the end (delta: -1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 80.9MB 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.9s. 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, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 41 mSDtfsCounter, 25 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: 42ms 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-04 15:33:35,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:33:35,341 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