./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/termination.prp --file ../../../trunk/examples/svcomp/termination-bwb/or-04.c --full-output --cacsl2boogietranslator.use.bitabs.translation true --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 514d202d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/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 --cacsl2boogietranslator.use.bitabs.translation true --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-514d202-m [2024-02-09 14:17:51,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 14:17:51,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-02-09 14:17:51,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 14:17:51,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 14:17:51,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 14:17:51,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 14:17:51,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 14:17:51,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-09 14:17:51,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-09 14:17:51,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 14:17:51,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 14:17:51,400 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 14:17:51,401 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 14:17:51,401 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 14:17:51,402 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 14:17:51,402 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 14:17:51,403 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 14:17:51,403 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 14:17:51,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 14:17:51,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 14:17:51,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 14:17:51,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 14:17:51,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 14:17:51,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 14:17:51,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 14:17:51,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-09 14:17:51,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 14:17:51,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 14:17:51,410 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 14:17:51,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 14:17:51,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 14:17:51,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 14:17:51,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 14:17:51,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 14:17:51,412 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 14:17:51,412 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2024-02-09 14:17:51,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 14:17:51,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 14:17:51,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 14:17:51,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 14:17:51,654 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 14:17:51,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-bwb/or-04.c [2024-02-09 14:17:52,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 14:17:52,890 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 14:17:52,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-bwb/or-04.c [2024-02-09 14:17:52,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bf1c057/99640184fdd84adda8e89e61465cde49/FLAGf57db3658 [2024-02-09 14:17:52,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29bf1c057/99640184fdd84adda8e89e61465cde49 [2024-02-09 14:17:52,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 14:17:52,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-09 14:17:52,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 14:17:52,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 14:17:52,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 14:17:52,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 02:17:52" (1/1) ... [2024-02-09 14:17:52,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce3b612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:52, skipping insertion in model container [2024-02-09 14:17:52,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 02:17:52" (1/1) ... [2024-02-09 14:17:52,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 14:17:53,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 14:17:53,061 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 14:17:53,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 14:17:53,085 INFO L206 MainTranslator]: Completed translation [2024-02-09 14:17:53,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53 WrapperNode [2024-02-09 14:17:53,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 14:17:53,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 14:17:53,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 14:17:53,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 14:17:53,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,110 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2024-02-09 14:17:53,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 14:17:53,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 14:17:53,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 14:17:53,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 14:17:53,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,129 INFO L175 MemorySlicer]: No memory access in input program. [2024-02-09 14:17:53,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 14:17:53,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 14:17:53,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 14:17:53,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 14:17:53,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (1/1) ... [2024-02-09 14:17:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:53,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 14:17:53,174 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-02-09 14:17:53,207 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-02-09 14:17:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 14:17:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 14:17:53,277 INFO L241 CfgBuilder]: Building ICFG [2024-02-09 14:17:53,279 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 14:17:53,393 INFO L282 CfgBuilder]: Performing block encoding [2024-02-09 14:17:53,400 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 14:17:53,401 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-09 14:17:53,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 02:17:53 BoogieIcfgContainer [2024-02-09 14:17:53,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 14:17:53,402 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 14:17:53,402 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 14:17:53,405 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 14:17:53,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 14:17:53,406 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 02:17:52" (1/3) ... [2024-02-09 14:17:53,407 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dbdbd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 02:17:53, skipping insertion in model container [2024-02-09 14:17:53,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 14:17:53,407 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 02:17:53" (2/3) ... [2024-02-09 14:17:53,409 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dbdbd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 02:17:53, skipping insertion in model container [2024-02-09 14:17:53,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 14:17:53,409 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 02:17:53" (3/3) ... [2024-02-09 14:17:53,410 INFO L332 chiAutomizerObserver]: Analyzing ICFG or-04.c [2024-02-09 14:17:53,481 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 14:17:53,482 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 14:17:53,482 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 14:17:53,482 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 14:17:53,482 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 14:17:53,482 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 14:17:53,482 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 14:17:53,483 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 14:17:53,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2024-02-09 14:17:53,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-02-09 14:17:53,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 14:17:53,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 14:17:53,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-02-09 14:17:53,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 14:17:53,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 14:17:53,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2024-02-09 14:17:53,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-02-09 14:17:53,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 14:17:53,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 14:17:53,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-02-09 14:17:53,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 14:17:53,511 INFO L748 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 11#L-1true 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_~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; 6#L20-2true [2024-02-09 14:17:53,512 INFO L750 eck$LassoCheckResult]: Loop: 6#L20-2true assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 9#L21-2true assume !(0 != main_~y~0#1); 6#L20-2true [2024-02-09 14:17:53,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-02-09 14:17:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865213098] [2024-02-09 14:17:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:53,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1320, now seen corresponding path program 1 times [2024-02-09 14:17:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238817458] [2024-02-09 14:17:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 14:17:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 14:17:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 14:17:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238817458] [2024-02-09 14:17:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238817458] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 14:17:53,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 14:17:53,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-09 14:17:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441299981] [2024-02-09 14:17:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 14:17:53,687 INFO L765 eck$LassoCheckResult]: loop already infeasible [2024-02-09 14:17:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 14:17:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-09 14:17:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-09 14:17:53,712 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) 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) [2024-02-09 14:17:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-02-09 14:17:53,754 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-02-09 14:17:53,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-02-09 14:17:53,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-02-09 14:17:53,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2024-02-09 14:17:53,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-02-09 14:17:53,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-02-09 14:17:53,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-02-09 14:17:53,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-02-09 14:17:53,761 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-02-09 14:17:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-02-09 14:17:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-02-09 14:17:53,777 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) [2024-02-09 14:17:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-02-09 14:17:53,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-02-09 14:17:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-09 14:17:53,782 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-02-09 14:17:53,782 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 14:17:53,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-02-09 14:17:53,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-02-09 14:17:53,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 14:17:53,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 14:17:53,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-02-09 14:17:53,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-09 14:17:53,784 INFO L748 eck$LassoCheckResult]: Stem: 40#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 41#L-1 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_~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; 38#L20-2 [2024-02-09 14:17:53,784 INFO L750 eck$LassoCheckResult]: Loop: 38#L20-2 assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 39#L21-2 assume !!(0 != main_~y~0#1); 37#L21 assume main_~y~0#1 > 0; 35#L22 assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1); 36#L22-2 assume !(0 == 1 + main_~y~0#1);assume (main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~nondet2#1 >= 1 + main_~y~0#1;assume (main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~nondet2#1 >= main_~y~0#1;assume (main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~nondet2#1 <= main_~y~0#1 + (1 + main_~y~0#1);assume (main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~nondet2#1 < 0;assume main_#t~nondet2#1 <= 2147483647; 42#L22-4 main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1; 43#L21-2 assume !(0 != main_~y~0#1); 38#L20-2 [2024-02-09 14:17:53,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-02-09 14:17:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:53,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730160637] [2024-02-09 14:17:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:53,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash -784860095, now seen corresponding path program 1 times [2024-02-09 14:17:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155541914] [2024-02-09 14:17:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:53,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 761436735, now seen corresponding path program 1 times [2024-02-09 14:17:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:53,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908202020] [2024-02-09 14:17:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:53,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:53,932 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 14:17:53,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 14:17:53,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 14:17:53,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 14:17:53,933 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 14:17:53,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:53,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 14:17:53,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 14:17:53,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: or-04.c_Iteration2_Loop [2024-02-09 14:17:53,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 14:17:53,934 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 14:17:53,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 14:17:54,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 14:17:54,115 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 14:17:54,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:54,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 14:17:54,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 14:17:54,121 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-02-09 14:17:54,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 14:17:54,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 14:17:54,151 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 [2024-02-09 14:17:54,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:54,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 14:17:54,153 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-02-09 14:17:54,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 14:17:54,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 14:17:54,165 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-02-09 14:17:54,185 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 14:17:54,194 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 [2024-02-09 14:17:54,194 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 14:17:54,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 14:17:54,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 14:17:54,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 14:17:54,195 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 14:17:54,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:54,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 14:17:54,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 14:17:54,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: or-04.c_Iteration2_Loop [2024-02-09 14:17:54,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 14:17:54,195 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 14:17:54,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 14:17:54,260 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 14:17:54,263 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 14:17:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 14:17:54,265 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-02-09 14:17:54,270 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-02-09 14:17:54,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 14:17:54,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 14:17:54,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 14:17:54,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 14:17:54,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 14:17:54,280 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-02-09 14:17:54,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 14:17:54,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 14:17:54,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 14:17:54,298 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-02-09 14:17:54,299 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-09 14:17:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 14:17:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 14:17:54,351 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-02-09 14:17:54,352 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 14:17:54,352 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 14:17:54,353 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 14:17:54,353 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2024-02-09 14:17:54,356 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-02-09 14:17:54,356 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-02-09 14:17:54,358 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 14:17:54,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 14:17:54,396 WARN L260 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 14:17:54,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 14:17:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 14:17:54,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 14:17:54,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 14:17:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-09 14:17:54,454 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-02-09 14:17:54,455 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 14:17:54,509 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 36 transitions. Complement of second has 6 states. [2024-02-09 14:17:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 14:17:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 14:17:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-02-09 14:17:54,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 7 letters. [2024-02-09 14:17:54,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 14:17:54,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 9 letters. Loop has 7 letters. [2024-02-09 14:17:54,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 14:17:54,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 14 letters. [2024-02-09 14:17:54,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 14:17:54,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2024-02-09 14:17:54,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-02-09 14:17:54,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2024-02-09 14:17:54,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-02-09 14:17:54,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-02-09 14:17:54,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2024-02-09 14:17:54,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 14:17:54,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-02-09 14:17:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2024-02-09 14:17:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2024-02-09 14:17:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-02-09 14:17:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-02-09 14:17:54,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-02-09 14:17:54,519 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-02-09 14:17:54,519 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 14:17:54,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-02-09 14:17:54,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-02-09 14:17:54,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 14:17:54,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 14:17:54,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-02-09 14:17:54,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 14:17:54,520 INFO L748 eck$LassoCheckResult]: Stem: 133#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 134#L-1 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_~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; 127#L20-2 assume !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0); 129#L21-2 assume !!(0 != main_~y~0#1); 131#L21 assume main_~y~0#1 > 0; 123#L22 [2024-02-09 14:17:54,520 INFO L750 eck$LassoCheckResult]: Loop: 123#L22 assume !(0 == main_~y~0#1 || main_~y~0#1 == 1 + main_~y~0#1); 124#L22-2 assume !(0 == 1 + main_~y~0#1);assume (main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~nondet2#1 >= 1 + main_~y~0#1;assume (main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~nondet2#1 >= main_~y~0#1;assume (main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~nondet2#1 <= main_~y~0#1 + (1 + main_~y~0#1);assume (main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~nondet2#1 < 0;assume main_#t~nondet2#1 <= 2147483647; 137#L22-4 main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1; 135#L21-2 assume !!(0 != main_~y~0#1); 136#L21 assume main_~y~0#1 > 0; 123#L22 [2024-02-09 14:17:54,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 28699947, now seen corresponding path program 1 times [2024-02-09 14:17:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028671496] [2024-02-09 14:17:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:54,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash 55505120, now seen corresponding path program 1 times [2024-02-09 14:17:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947727320] [2024-02-09 14:17:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:54,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 14:17:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2129702390, now seen corresponding path program 1 times [2024-02-09 14:17:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 14:17:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582204685] [2024-02-09 14:17:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 14:17:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 14:17:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 14:17:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 14:17:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 14:17:54,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 02:17:54 BoogieIcfgContainer [2024-02-09 14:17:54,665 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 14:17:54,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-02-09 14:17:54,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-02-09 14:17:54,666 INFO L274 PluginConnector]: Witness Printer initialized [2024-02-09 14:17:54,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 02:17:53" (3/4) ... [2024-02-09 14:17:54,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2024-02-09 14:17:54,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-02-09 14:17:54,668 INFO L158 Benchmark]: Toolchain (without parser) took 1760.22ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 101.2MB in the end (delta: -3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-09 14:17:54,669 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 75.8MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-09 14:17:54,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.72ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 88.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-02-09 14:17:54,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.34ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 86.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-09 14:17:54,670 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 85.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-09 14:17:54,670 INFO L158 Benchmark]: RCFGBuilder took 261.25ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 74.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-02-09 14:17:54,671 INFO L158 Benchmark]: BuchiAutomizer took 1262.73ms. Allocated memory is still 167.8MB. Free memory was 74.6MB in the beginning and 101.2MB in the end (delta: -26.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-09 14:17:54,671 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-09 14:17:54,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 75.8MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.72ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 88.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.34ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 86.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 85.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.25ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 74.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1262.73ms. Allocated memory is still 167.8MB. Free memory was 74.6MB in the beginning and 101.2MB in the end (delta: -26.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory is still 101.2MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 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: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 15 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf94 smp86 dnf100 smp100 tf106 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 89ms VariablesStem: 0 VariablesLoop: 4 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 { :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_~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 !!(main_~x~0#1 >= main_~y~0#1 && main_~y~0#1 > 0);" "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);assume (main_~y~0#1 < 0 && 1 + main_~y~0#1 >= 0) || main_#t~nondet2#1 >= 1 + main_~y~0#1;assume (main_~y~0#1 >= 0 && 1 + main_~y~0#1 < 0) || main_#t~nondet2#1 >= main_~y~0#1;assume (main_~y~0#1 < 0 || 1 + main_~y~0#1 < 0) || main_#t~nondet2#1 <= main_~y~0#1 + (1 + main_~y~0#1);assume (main_~y~0#1 >= 0 && 1 + main_~y~0#1 >= 0) || main_#t~nondet2#1 < 0;assume main_#t~nondet2#1 <= 2147483647;" "main_~y~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~y~0#1 := main_~x~0#1 - main_~y~0#1;" "assume !!(0 != main_~y~0#1);" "assume main_~y~0#1 > 0;" RESULT: Ultimate could not prove your program: unable to determine termination [2024-02-09 14:17:54,684 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-02-09 14:17:54,886 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 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