./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/or-04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/or-04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c5de9087a921e8aad95bc80b29f24bf9506596da18bf9b4640846346a82bb2ae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:31:15,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:31:15,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-10 22:31:15,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:31:15,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:31:15,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:31:15,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:31:15,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:31:15,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:31:15,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:31:15,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:31:15,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:31:15,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:31:15,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:31:15,663 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:31:15,663 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:31:15,663 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:31:15,663 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:31:15,663 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:31:15,664 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:31:15,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:31:15,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:31:15,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:31:15,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:31:15,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:31:15,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:31:15,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:31:15,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:31:15,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:31:15,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:31:15,666 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:31:15,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:31:15,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:31:15,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:31:15,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:31:15,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:31:15,667 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:31:15,667 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c5de9087a921e8aad95bc80b29f24bf9506596da18bf9b4640846346a82bb2ae [2024-11-10 22:31:15,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:31:15,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:31:15,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:31:15,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:31:15,867 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:31:15,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/or-04.c [2024-11-10 22:31:17,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:31:17,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:31:17,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/or-04.c [2024-11-10 22:31:17,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4804d39e2/54e3f858d73d4f1cb7df2faa52d3dd27/FLAGb153e5a98 [2024-11-10 22:31:17,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4804d39e2/54e3f858d73d4f1cb7df2faa52d3dd27 [2024-11-10 22:31:17,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:31:17,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:31:17,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:31:17,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:31:17,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:31:17,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c5bb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17, skipping insertion in model container [2024-11-10 22:31:17,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:31:17,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:31:17,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:31:17,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:31:17,409 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:31:17,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17 WrapperNode [2024-11-10 22:31:17,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:31:17,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:31:17,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:31:17,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:31:17,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,431 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-10 22:31:17,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:31:17,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:31:17,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:31:17,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:31:17,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,443 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 22:31:17,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:31:17,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:31:17,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:31:17,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:31:17,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (1/1) ... [2024-11-10 22:31:17,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:17,479 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) [2024-11-10 22:31:17,482 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 [2024-11-10 22:31:17,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:31:17,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:31:17,560 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:31:17,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:31:17,666 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-10 22:31:17,666 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:31:17,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:31:17,684 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:31:17,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:17 BoogieIcfgContainer [2024-11-10 22:31:17,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:31:17,685 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:31:17,685 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:31:17,688 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:31:17,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:17,688 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:31:17" (1/3) ... [2024-11-10 22:31:17,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@512e89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:31:17, skipping insertion in model container [2024-11-10 22:31:17,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:17,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:17" (2/3) ... [2024-11-10 22:31:17,689 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@512e89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:31:17, skipping insertion in model container [2024-11-10 22:31:17,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:31:17,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:17" (3/3) ... [2024-11-10 22:31:17,690 INFO L332 chiAutomizerObserver]: Analyzing ICFG or-04.c [2024-11-10 22:31:17,728 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:31:17,729 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:31:17,729 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:31:17,729 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:31:17,729 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:31:17,729 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:31:17,729 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:31:17,729 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:31:17,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:17,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:31:17,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:17,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:17,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:17,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:31:17,746 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:31:17,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:31:17,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:31:17,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:17,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:17,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:17,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:31:17,754 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#ULTIMATE.init_returnLabel#1true assume true;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~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 14#L19true [2024-11-10 22:31:17,754 INFO L747 eck$LassoCheckResult]: Loop: 14#L19true assume true; 4#L19-1true assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 15#L20true assume !true; 14#L19true [2024-11-10 22:31:17,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1632, now seen corresponding path program 1 times [2024-11-10 22:31:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382121256] [2024-11-10 22:31:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:17,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:17,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash 47631, now seen corresponding path program 1 times [2024-11-10 22:31:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050129174] [2024-11-10 22:31:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:17,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:17,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050129174] [2024-11-10 22:31:17,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050129174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:31:17,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:31:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 22:31:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875109339] [2024-11-10 22:31:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:31:17,888 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:31:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:17,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 22:31:17,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:31:17,915 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-10 22:31:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:17,925 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-11-10 22:31:17,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-11-10 22:31:17,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:31:17,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2024-11-10 22:31:17,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-10 22:31:17,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 22:31:17,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2024-11-10 22:31:17,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:31:17,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2024-11-10 22:31:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2024-11-10 22:31:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-10 22:31:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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) [2024-11-10 22:31:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2024-11-10 22:31:17,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2024-11-10 22:31:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 22:31:17,959 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2024-11-10 22:31:17,959 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:31:17,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2024-11-10 22:31:17,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-10 22:31:17,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:17,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:17,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:17,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:31:17,962 INFO L745 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41#ULTIMATE.init_returnLabel#1 assume true;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~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 42#L19 [2024-11-10 22:31:17,962 INFO L747 eck$LassoCheckResult]: Loop: 42#L19 assume true; 45#L19-1 assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 39#L20 assume true; 48#L20-1 assume !(0 != main_~y~0#1); 42#L19 [2024-11-10 22:31:17,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1632, now seen corresponding path program 2 times [2024-11-10 22:31:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994478489] [2024-11-10 22:31:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:17,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:17,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:17,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1476542, now seen corresponding path program 1 times [2024-11-10 22:31:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898643986] [2024-11-10 22:31:17,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:31:18,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:31:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898643986] [2024-11-10 22:31:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898643986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:31:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:31:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:31:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395073867] [2024-11-10 22:31:18,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:31:18,008 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:31:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:31:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:31:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:31:18,009 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2024-11-10 22:31:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:31:18,036 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-11-10 22:31:18,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-11-10 22:31:18,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-10 22:31:18,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2024-11-10 22:31:18,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-10 22:31:18,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-10 22:31:18,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-10 22:31:18,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:31:18,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 22:31:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-10 22:31:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-10 22:31:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 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) [2024-11-10 22:31:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-10 22:31:18,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 22:31:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:31:18,040 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-10 22:31:18,040 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:31:18,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-10 22:31:18,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-10 22:31:18,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:18,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:18,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:31:18,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:31:18,042 INFO L745 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 72#ULTIMATE.init_returnLabel#1 assume true;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~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 73#L19 [2024-11-10 22:31:18,042 INFO L747 eck$LassoCheckResult]: Loop: 73#L19 assume true; 76#L19-1 assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 77#L20 assume true; 78#L20-1 assume !!(0 != main_~y~0#1); 74#L21 assume main_~y~0#1 > 0; 75#L22-4 assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1); 79#L22-3 assume !(0 == 1 + main_~y~0#1); 80#L22-2 havoc main_#t~bitwise2#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647; 69#L22 main_~y~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1; 70#L20 assume true; 81#L20-1 assume !(0 != main_~y~0#1); 73#L19 [2024-11-10 22:31:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1632, now seen corresponding path program 3 times [2024-11-10 22:31:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:18,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539670911] [2024-11-10 22:31:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:18,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1888451157, now seen corresponding path program 1 times [2024-11-10 22:31:18,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761048639] [2024-11-10 22:31:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:18,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1968968342, now seen corresponding path program 1 times [2024-11-10 22:31:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274367365] [2024-11-10 22:31:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:18,257 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:31:18,258 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:31:18,258 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:31:18,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:31:18,258 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:31:18,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:31:18,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:31:18,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-04.c_Iteration3_Loop [2024-11-10 22:31:18,258 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:31:18,258 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:31:18,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:18,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:18,321 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:31:18,322 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:31:18,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:18,325 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) [2024-11-10 22:31:18,330 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 [2024-11-10 22:31:18,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:31:18,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:31:18,362 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 [2024-11-10 22:31:18,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:18,363 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) [2024-11-10 22:31:18,364 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 [2024-11-10 22:31:18,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:31:18,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:31:18,388 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:31:18,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:31:18,393 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:31:18,393 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:31:18,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:31:18,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:31:18,393 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:31:18,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:31:18,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:31:18,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: or-04.c_Iteration3_Loop [2024-11-10 22:31:18,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:31:18,393 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:31:18,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:18,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:31:18,427 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:31:18,430 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:31:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:18,433 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) [2024-11-10 22:31:18,434 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 [2024-11-10 22:31:18,435 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 [2024-11-10 22:31:18,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:18,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:18,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:18,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:18,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:18,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:18,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:18,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:31:18,459 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 [2024-11-10 22:31:18,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:18,460 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) [2024-11-10 22:31:18,461 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 [2024-11-10 22:31:18,462 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 [2024-11-10 22:31:18,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:31:18,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:31:18,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:31:18,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:31:18,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:31:18,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:31:18,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:31:18,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:31:18,481 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-10 22:31:18,481 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 22:31:18,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:31:18,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:31:18,502 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) [2024-11-10 22:31:18,504 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 [2024-11-10 22:31:18,505 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:31:18,505 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:31:18,505 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:31:18,506 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2024-11-10 22:31:18,517 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 [2024-11-10 22:31:18,520 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:31:18,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:18,543 WARN L253 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:31:18,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:31:18,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:31:18,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:31:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:31:18,599 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 [2024-11-10 22:31:18,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-10 22:31:18,656 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) Result 38 states and 46 transitions. Complement of second has 8 states. [2024-11-10 22:31:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-10 22:31:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2024-11-10 22:31:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-11-10 22:31:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 11 letters. [2024-11-10 22:31:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 11 letters. [2024-11-10 22:31:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 22 letters. [2024-11-10 22:31:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:31:18,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2024-11-10 22:31:18,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 22:31:18,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2024-11-10 22:31:18,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-10 22:31:18,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-10 22:31:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2024-11-10 22:31:18,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:31:18,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-10 22:31:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2024-11-10 22:31:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2024-11-10 22:31:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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) [2024-11-10 22:31:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-10 22:31:18,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-10 22:31:18,669 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-10 22:31:18,669 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:31:18,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2024-11-10 22:31:18,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:31:18,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:31:18,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:31:18,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:31:18,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:31:18,673 INFO L745 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 191#ULTIMATE.init_returnLabel#1 assume true;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~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 192#L19 assume true; 197#L19-1 assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 198#L20 assume true; 211#L20-1 assume !!(0 != main_~y~0#1); 193#L21 assume main_~y~0#1 > 0; 194#L22-4 [2024-11-10 22:31:18,673 INFO L747 eck$LassoCheckResult]: Loop: 194#L22-4 assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1); 204#L22-3 assume !(0 == 1 + main_~y~0#1); 205#L22-2 havoc main_#t~bitwise2#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647; 186#L22 main_~y~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1; 187#L20 assume true; 201#L20-1 assume !!(0 != main_~y~0#1); 202#L21 assume main_~y~0#1 > 0; 194#L22-4 [2024-11-10 22:31:18,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -504722131, now seen corresponding path program 1 times [2024-11-10 22:31:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547892675] [2024-11-10 22:31:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:18,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1390786304, now seen corresponding path program 1 times [2024-11-10 22:31:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060701710] [2024-11-10 22:31:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:18,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:31:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash 908476500, now seen corresponding path program 1 times [2024-11-10 22:31:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:31:18,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604855022] [2024-11-10 22:31:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:31:18,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:31:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:31:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:31:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:31:18,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:31:18 BoogieIcfgContainer [2024-11-10 22:31:18,883 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:31:18,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:31:18,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:31:18,883 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:31:18,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:31:17" (3/4) ... [2024-11-10 22:31:18,885 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:31:18,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:31:18,886 INFO L158 Benchmark]: Toolchain (without parser) took 1647.79ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 102.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2024-11-10 22:31:18,887 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:31:18,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.35ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 92.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 22:31:18,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.35ms. Allocated memory is still 176.2MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:31:18,888 INFO L158 Benchmark]: Boogie Preprocessor took 14.82ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:31:18,888 INFO L158 Benchmark]: IcfgBuilder took 237.25ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 143.8MB in the end (delta: -54.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-10 22:31:18,888 INFO L158 Benchmark]: BuchiAutomizer took 1197.75ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 102.3MB in the end (delta: 41.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-10 22:31:18,888 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 102.0MB in the end (delta: 331.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:31:18,891 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.15ms. Allocated memory is still 176.2MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.35ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 92.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.35ms. Allocated memory is still 176.2MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.82ms. Allocated memory is still 176.2MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 237.25ms. Allocated memory is still 176.2MB. Free memory was 89.3MB in the beginning and 143.8MB in the end (delta: -54.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1197.75ms. Allocated memory is still 176.2MB. Free memory was 143.8MB in the beginning and 102.3MB in the end (delta: 41.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 176.2MB. Free memory was 102.3MB in the beginning and 102.0MB in the end (delta: 331.8kB). 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function y and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 33 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq117 hnf96 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Unable to decide termination Buchi Automizer cannot decide termination for the following lasso because it contains the following overapproximations. Overapproximations C: y|(y+1) [22] (Reason bitwiseOr) Lasso Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume true;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~bitwise2#1, main_~y~0#1, main_~x~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume true;" "assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0);" "assume true;" "assume !!(0 != main_~y~0#1);" "assume main_~y~0#1 > 0;" Loop: "assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1);" "assume !(0 == 1 + main_~y~0#1);" "havoc main_#t~bitwise2#1;assume (((((main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 >= 1 + main_~y~0#1) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 >= main_~y~0#1)) && ((main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~bitwise2#1 <= main_~y~0#1 + (1 + main_~y~0#1))) && ((main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~bitwise2#1 < 0)) && main_#t~bitwise2#1 <= 2147483647;" "main_~y~0#1 := main_#t~bitwise2#1;havoc main_#t~bitwise2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1;" "assume true;" "assume !!(0 != main_~y~0#1);" "assume main_~y~0#1 > 0;" RESULT: Ultimate could not prove your program: unable to determine termination [2024-11-10 22:31:18,912 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 [2024-11-10 22:31:19,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN