./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDown.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 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:53:05,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:53:05,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:53:05,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:53:05,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:53:05,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:53:05,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:53:05,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:53:05,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:53:05,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:53:05,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:53:05,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:53:05,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:53:05,306 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:53:05,306 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:53:05,307 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:53:05,307 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:53:05,307 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:53:05,307 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:53:05,307 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:53:05,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:53:05,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:53:05,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:53:05,308 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:53:05,308 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 [2025-03-17 19:53:05,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:53:05,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:53:05,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:53:05,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:53:05,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:53:05,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2025-03-17 19:53:06,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7e39265/6dba211fd5464cd19b957d7db2572558/FLAG61839bfdd [2025-03-17 19:53:06,954 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:53:06,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2025-03-17 19:53:06,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7e39265/6dba211fd5464cd19b957d7db2572558/FLAG61839bfdd [2025-03-17 19:53:07,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7e39265/6dba211fd5464cd19b957d7db2572558 [2025-03-17 19:53:07,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:53:07,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:53:07,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:53:07,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:53:07,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:53:07,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6900b394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07, skipping insertion in model container [2025-03-17 19:53:07,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:53:07,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:53:07,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:53:07,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:53:07,443 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:53:07,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07 WrapperNode [2025-03-17 19:53:07,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:53:07,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:53:07,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:53:07,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:53:07,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,462 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-17 19:53:07,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:53:07,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:53:07,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:53:07,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:53:07,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,473 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:53:07,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:53:07,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:53:07,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:53:07,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:53:07,481 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (1/1) ... [2025-03-17 19:53:07,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:07,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:07,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:53:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:53:07,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:53:07,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:53:07,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:53:07,640 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-17 19:53:07,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:53:07,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:53:07,649 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:53:07,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:53:07 BoogieIcfgContainer [2025-03-17 19:53:07,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:53:07,651 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:53:07,651 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:53:07,655 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:53:07,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:53:07,656 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:53:07" (1/3) ... [2025-03-17 19:53:07,657 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79e38827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:53:07, skipping insertion in model container [2025-03-17 19:53:07,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:53:07,658 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:53:07" (2/3) ... [2025-03-17 19:53:07,658 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79e38827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:53:07, skipping insertion in model container [2025-03-17 19:53:07,658 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:53:07,658 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:53:07" (3/3) ... [2025-03-17 19:53:07,659 INFO L363 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2025-03-17 19:53:07,697 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:53:07,697 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:53:07,697 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:53:07,697 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:53:07,697 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:53:07,698 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:53:07,698 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:53:07,698 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:53:07,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:07,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:53:07,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:53:07,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:07,714 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:53:07,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:07,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:53:07,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:53:07,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:07,719 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:07,720 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:53:07,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 1 times [2025-03-17 19:53:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798256034] [2025-03-17 19:53:07,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1136957, now seen corresponding path program 1 times [2025-03-17 19:53:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777254710] [2025-03-17 19:53:07,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:07,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:07,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:07,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777254710] [2025-03-17 19:53:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777254710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:07,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253925892] [2025-03-17 19:53:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:07,873 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:07,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:53:07,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:53:07,892 INFO L87 Difference]: Start difference. First operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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, 3 states have (on average 1.3333333333333333) 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) [2025-03-17 19:53:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:07,927 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2025-03-17 19:53:07,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2025-03-17 19:53:07,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:53:07,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 14 transitions. [2025-03-17 19:53:07,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:53:07,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:53:07,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2025-03-17 19:53:07,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:53:07,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:53:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2025-03-17 19:53:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 19:53:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2025-03-17 19:53:07,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:53:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:53:07,955 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2025-03-17 19:53:07,955 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:53:07,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2025-03-17 19:53:07,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:53:07,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:07,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:07,956 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:53:07,956 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:07,956 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:07,957 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:53:07,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash 39, now seen corresponding path program 2 times [2025-03-17 19:53:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905704440] [2025-03-17 19:53:07,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:07,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:07,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:07,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1137918, now seen corresponding path program 1 times [2025-03-17 19:53:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775110221] [2025-03-17 19:53:07,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:07,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:07,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:07,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 36231716, now seen corresponding path program 1 times [2025-03-17 19:53:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827491352] [2025-03-17 19:53:07,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:07,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:07,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:53:07,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:53:07,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:07,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:53:07,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:53:07,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:07,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:07,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,051 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,052 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:08,052 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,052 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,052 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,052 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2025-03-17 19:53:08,052 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,052 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,129 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,129 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:53:08,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,151 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,151 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 19:53:08,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:53:08,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,181 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,181 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:53:08,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,210 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,211 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:53:08,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 19:53:08,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:53:08,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:08,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,261 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:08,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,268 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,268 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,268 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,268 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:08,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2025-03-17 19:53:08,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,268 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,339 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,342 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:08,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:53:08,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:08,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:08,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:08,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:53:08,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:08,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:08,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:08,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:53:08,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,420 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:53:08,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:08,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:08,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:08,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:08,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:08,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:08,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:08,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:08,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:08,438 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:08,440 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:08,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,443 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:53:08,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:08,446 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:08,446 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:08,447 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2025-03-17 19:53:08,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:53:08,456 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:53:08,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:53:08,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:08,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:08,526 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:08,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,580 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 46 transitions. Complement of second has 7 states. [2025-03-17 19:53:08,582 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 [2025-03-17 19:53:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2025-03-17 19:53:08,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 19:53:08,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 19:53:08,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 1 letters. Loop has 8 letters. [2025-03-17 19:53:08,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:08,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 46 transitions. [2025-03-17 19:53:08,589 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2025-03-17 19:53:08,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 40 transitions. [2025-03-17 19:53:08,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 19:53:08,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-03-17 19:53:08,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 40 transitions. [2025-03-17 19:53:08,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:08,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2025-03-17 19:53:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 40 transitions. [2025-03-17 19:53:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-03-17 19:53:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2025-03-17 19:53:08,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-03-17 19:53:08,594 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-03-17 19:53:08,594 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:53:08,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2025-03-17 19:53:08,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-03-17 19:53:08,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:08,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:08,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:53:08,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:08,595 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-03-17 19:53:08,595 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" [2025-03-17 19:53:08,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1216, now seen corresponding path program 1 times [2025-03-17 19:53:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608163559] [2025-03-17 19:53:08,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:08,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:08,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1106149, now seen corresponding path program 1 times [2025-03-17 19:53:08,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498053694] [2025-03-17 19:53:08,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:08,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:08,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1123184164, now seen corresponding path program 1 times [2025-03-17 19:53:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414431557] [2025-03-17 19:53:08,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:08,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:53:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:53:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414431557] [2025-03-17 19:53:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414431557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:53:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160562900] [2025-03-17 19:53:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:08,696 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,696 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,696 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,696 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,696 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:08,696 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,696 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,696 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,696 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2025-03-17 19:53:08,696 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,696 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,787 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,789 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:53:08,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,808 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:08,808 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:08,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:53:08,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:08,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-17 19:53:08,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,863 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:08,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:53:08,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:08,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:08,899 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:08,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:08,903 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:08,903 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:08,903 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:08,903 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:08,903 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:08,903 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,903 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:08,903 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:08,903 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2025-03-17 19:53:08,903 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:08,903 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:08,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:08,996 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:08,996 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:08,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:08,998 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:53:09,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:09,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:09,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:09,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-17 19:53:09,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,027 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:53:09,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,039 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:53:09,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,041 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:53:09,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:09,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:09,046 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:09,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,048 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:53:09,050 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:09,050 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:09,050 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:09,050 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2025-03-17 19:53:09,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,057 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:09,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:53:09,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:53:09,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,113 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:09,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 56 transitions. Complement of second has 7 states. [2025-03-17 19:53:09,141 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 [2025-03-17 19:53:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:53:09,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-17 19:53:09,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-17 19:53:09,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2025-03-17 19:53:09,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2025-03-17 19:53:09,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-03-17 19:53:09,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 30 states and 48 transitions. [2025-03-17 19:53:09,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-03-17 19:53:09,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 19:53:09,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 48 transitions. [2025-03-17 19:53:09,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 48 transitions. [2025-03-17 19:53:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 48 transitions. [2025-03-17 19:53:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-17 19:53:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2025-03-17 19:53:09,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2025-03-17 19:53:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:09,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:53:09,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:53:09,150 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:09,159 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2025-03-17 19:53:09,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 53 transitions. [2025-03-17 19:53:09,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-17 19:53:09,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 46 transitions. [2025-03-17 19:53:09,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 19:53:09,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 19:53:09,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2025-03-17 19:53:09,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 46 transitions. [2025-03-17 19:53:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2025-03-17 19:53:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-17 19:53:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2025-03-17 19:53:09,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-03-17 19:53:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:53:09,165 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-03-17 19:53:09,165 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:53:09,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 43 transitions. [2025-03-17 19:53:09,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-17 19:53:09,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 19:53:09,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:09,166 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:09,166 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:09,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 37701, now seen corresponding path program 1 times [2025-03-17 19:53:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177152640] [2025-03-17 19:53:09,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:53:09,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:53:09,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:53:09,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:53:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1044829, now seen corresponding path program 1 times [2025-03-17 19:53:09,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519034200] [2025-03-17 19:53:09,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash 458048161, now seen corresponding path program 1 times [2025-03-17 19:53:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535071213] [2025-03-17 19:53:09,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:53:09,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:53:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535071213] [2025-03-17 19:53:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535071213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:09,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218601719] [2025-03-17 19:53:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:09,236 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,236 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,236 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,236 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,236 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:09,236 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,236 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,236 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,236 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2025-03-17 19:53:09,236 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,236 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,289 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,290 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:09,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,291 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:53:09,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,311 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:53:09,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:09,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,324 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:09,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 19:53:09,329 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,329 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,329 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,329 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,329 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:09,329 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,329 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,329 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,330 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2025-03-17 19:53:09,330 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,330 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,390 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,390 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,393 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:53:09,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:09,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:09,413 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:53:09,413 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:09,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,415 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:53:09,417 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:09,417 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:09,417 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:09,417 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:09,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:53:09,423 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:53:09,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:53:09,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,455 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:09,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 43 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 84 transitions. Complement of second has 7 states. [2025-03-17 19:53:09,482 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 [2025-03-17 19:53:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-17 19:53:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 19:53:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 19:53:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2025-03-17 19:53:09,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 84 transitions. [2025-03-17 19:53:09,484 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2025-03-17 19:53:09,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 49 states and 76 transitions. [2025-03-17 19:53:09,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 19:53:09,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-17 19:53:09,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 76 transitions. [2025-03-17 19:53:09,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 76 transitions. [2025-03-17 19:53:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 76 transitions. [2025-03-17 19:53:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 19:53:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 48 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 76 transitions. [2025-03-17 19:53:09,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 76 transitions. [2025-03-17 19:53:09,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:09,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:53:09,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:53:09,487 INFO L87 Difference]: Start difference. First operand 49 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:09,501 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2025-03-17 19:53:09,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 77 transitions. [2025-03-17 19:53:09,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-17 19:53:09,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 77 transitions. [2025-03-17 19:53:09,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-17 19:53:09,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-17 19:53:09,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 77 transitions. [2025-03-17 19:53:09,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 77 transitions. [2025-03-17 19:53:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 77 transitions. [2025-03-17 19:53:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-17 19:53:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-17 19:53:09,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-17 19:53:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:53:09,506 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-17 19:53:09,506 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:53:09,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2025-03-17 19:53:09,506 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2025-03-17 19:53:09,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:53:09,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:09,506 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" [2025-03-17 19:53:09,506 INFO L754 eck$LassoCheckResult]: Loop: "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" [2025-03-17 19:53:09,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1168766, now seen corresponding path program 1 times [2025-03-17 19:53:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267132262] [2025-03-17 19:53:09,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 990020, now seen corresponding path program 1 times [2025-03-17 19:53:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993880386] [2025-03-17 19:53:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1343220289, now seen corresponding path program 1 times [2025-03-17 19:53:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080084538] [2025-03-17 19:53:09,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:09,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:09,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:09,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:09,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:09,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:09,555 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,555 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,555 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:09,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2025-03-17 19:53:09,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,555 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,616 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,619 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:09,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,621 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:53:09,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,642 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:09,642 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:09,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,650 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:53:09,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,651 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,668 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:09,669 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:09,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,676 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:53:09,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:09,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-17 19:53:09,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,695 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:53:09,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:09,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:09,756 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:09,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:53:09,761 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:09,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:09,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:09,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:09,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:09,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:09,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:09,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2025-03-17 19:53:09,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:09,761 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:09,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:09,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:09,812 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:09,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,814 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:53:09,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,825 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:53:09,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,826 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:53:09,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:09,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 19:53:09,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,835 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:53:09,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:53:09,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:53:09,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:09,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:53:09,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,857 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:53:09,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:09,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:09,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:09,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:09,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:09,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:09,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:09,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:09,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:09,873 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:09,873 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:09,884 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:53:09,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:09,885 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:09,885 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:09,885 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:09,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:09,891 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:09,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,941 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:53:09,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 30. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 106 states and 153 transitions. Complement of second has 7 states. [2025-03-17 19:53:09,963 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 [2025-03-17 19:53:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2025-03-17 19:53:09,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-17 19:53:09,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:53:09,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-17 19:53:09,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:09,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 153 transitions. [2025-03-17 19:53:09,965 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-03-17 19:53:09,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 92 states and 133 transitions. [2025-03-17 19:53:09,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-17 19:53:09,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-03-17 19:53:09,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 133 transitions. [2025-03-17 19:53:09,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:09,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 133 transitions. [2025-03-17 19:53:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 133 transitions. [2025-03-17 19:53:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2025-03-17 19:53:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.48) internal successors, (111), 74 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2025-03-17 19:53:09,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 111 transitions. [2025-03-17 19:53:09,970 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2025-03-17 19:53:09,970 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:53:09,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2025-03-17 19:53:09,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-03-17 19:53:09,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:09,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:09,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 19:53:09,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:09,971 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-17 19:53:09,971 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" [2025-03-17 19:53:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 36231717, now seen corresponding path program 1 times [2025-03-17 19:53:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5129968] [2025-03-17 19:53:09,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:53:09,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:53:09,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5129968] [2025-03-17 19:53:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5129968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:53:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958406184] [2025-03-17 19:53:09,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:09,994 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:09,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1137919, now seen corresponding path program 1 times [2025-03-17 19:53:09,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:09,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632987641] [2025-03-17 19:53:09,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:09,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:09,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:09,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:09,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632987641] [2025-03-17 19:53:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632987641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:53:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184379360] [2025-03-17 19:53:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,006 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:10,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:53:10,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:53:10,006 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. cyclomatic complexity: 46 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) [2025-03-17 19:53:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:10,012 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2025-03-17 19:53:10,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2025-03-17 19:53:10,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-03-17 19:53:10,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 49 states and 65 transitions. [2025-03-17 19:53:10,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 19:53:10,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 19:53:10,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2025-03-17 19:53:10,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,014 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 65 transitions. [2025-03-17 19:53:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2025-03-17 19:53:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2025-03-17 19:53:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 41 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-03-17 19:53:10,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-03-17 19:53:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:53:10,017 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-03-17 19:53:10,017 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 19:53:10,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2025-03-17 19:53:10,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-03-17 19:53:10,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:10,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:10,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:53:10,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:10,018 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:53:10,018 INFO L754 eck$LassoCheckResult]: Loop: "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" [2025-03-17 19:53:10,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1314591137, now seen corresponding path program 1 times [2025-03-17 19:53:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269940513] [2025-03-17 19:53:10,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 19:53:10,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:53:10,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-17 19:53:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269940513] [2025-03-17 19:53:10,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269940513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:10,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12146351] [2025-03-17 19:53:10,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:10,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,077 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-17 19:53:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12146351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:10,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 19:53:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768956377] [2025-03-17 19:53:10,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,128 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:10,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 960228, now seen corresponding path program 2 times [2025-03-17 19:53:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623742406] [2025-03-17 19:53:10,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:10,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,161 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,161 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:10,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2025-03-17 19:53:10,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,161 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,205 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,206 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:10,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,209 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:53:10,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,211 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,229 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:53:10,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:10,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,251 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:10,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:53:10,254 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:10,255 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2025-03-17 19:53:10,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,255 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,301 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,302 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:10,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,303 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:53:10,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:10,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:10,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:10,318 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:10,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:10,319 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:53:10,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,321 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:53:10,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:10,323 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:10,323 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:10,323 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-17 19:53:10,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-17 19:53:10,329 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:10,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:53:10,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:53:10,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,369 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:53:10,369 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 55 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,394 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 55 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 103 states and 131 transitions. Complement of second has 7 states. [2025-03-17 19:53:10,394 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 [2025-03-17 19:53:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-03-17 19:53:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:53:10,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 4 letters. [2025-03-17 19:53:10,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2025-03-17 19:53:10,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 131 transitions. [2025-03-17 19:53:10,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2025-03-17 19:53:10,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 96 states and 123 transitions. [2025-03-17 19:53:10,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-03-17 19:53:10,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-17 19:53:10,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 123 transitions. [2025-03-17 19:53:10,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-03-17 19:53:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 123 transitions. [2025-03-17 19:53:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2025-03-17 19:53:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 83 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2025-03-17 19:53:10,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 111 transitions. [2025-03-17 19:53:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:10,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:53:10,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:53:10,401 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:10,429 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2025-03-17 19:53:10,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 149 transitions. [2025-03-17 19:53:10,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2025-03-17 19:53:10,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 109 states and 129 transitions. [2025-03-17 19:53:10,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-17 19:53:10,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-17 19:53:10,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 129 transitions. [2025-03-17 19:53:10,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 129 transitions. [2025-03-17 19:53:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 129 transitions. [2025-03-17 19:53:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2025-03-17 19:53:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-03-17 19:53:10,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-03-17 19:53:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:53:10,436 INFO L432 stractBuchiCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-03-17 19:53:10,436 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 19:53:10,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 118 transitions. [2025-03-17 19:53:10,436 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-17 19:53:10,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:10,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:10,437 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 19:53:10,437 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:53:10,437 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:53:10,437 INFO L754 eck$LassoCheckResult]: Loop: "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" [2025-03-17 19:53:10,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1309844031, now seen corresponding path program 1 times [2025-03-17 19:53:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523110796] [2025-03-17 19:53:10,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:53:10,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:53:10,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:53:10,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:53:10,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1137949, now seen corresponding path program 2 times [2025-03-17 19:53:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389260648] [2025-03-17 19:53:10,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:53:10,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 479845085, now seen corresponding path program 2 times [2025-03-17 19:53:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636065263] [2025-03-17 19:53:10,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:53:10,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:53:10,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:10,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:10,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:53:10,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:53:10,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:10,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:10,502 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,502 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,502 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:10,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,503 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,503 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2025-03-17 19:53:10,503 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,503 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,557 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,557 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:10,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,559 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-17 19:53:10,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:10,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:10,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,583 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:53:10,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:10,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:10,597 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:10,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-17 19:53:10,603 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:10,603 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:10,604 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:10,604 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:10,604 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:10,604 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,604 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:10,604 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:10,604 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2025-03-17 19:53:10,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:10,604 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:10,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:10,655 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:10,655 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:10,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,656 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 19:53:10,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:10,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:10,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:10,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:10,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:10,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:10,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:10,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:10,670 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:10,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:10,673 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:10,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:10,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,674 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:53:10,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:10,677 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:10,677 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:10,677 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2025-03-17 19:53:10,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-17 19:53:10,683 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:10,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:53:10,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:53:10,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:53:10,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:53:10,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:53:10,735 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-17 19:53:10,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 118 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 118 transitions. cyclomatic complexity: 30. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 129 states and 155 transitions. Complement of second has 7 states. [2025-03-17 19:53:10,761 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 [2025-03-17 19:53:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-03-17 19:53:10,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2025-03-17 19:53:10,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 4 letters. [2025-03-17 19:53:10,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-17 19:53:10,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:10,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 155 transitions. [2025-03-17 19:53:10,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-03-17 19:53:10,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 107 states and 130 transitions. [2025-03-17 19:53:10,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-17 19:53:10,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-17 19:53:10,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 130 transitions. [2025-03-17 19:53:10,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 130 transitions. [2025-03-17 19:53:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 130 transitions. [2025-03-17 19:53:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2025-03-17 19:53:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 90 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-03-17 19:53:10,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-03-17 19:53:10,771 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-03-17 19:53:10,771 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 19:53:10,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 109 transitions. [2025-03-17 19:53:10,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2025-03-17 19:53:10,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:10,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:10,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 2, 1, 1, 1] [2025-03-17 19:53:10,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2025-03-17 19:53:10,772 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:10,772 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1005479669, now seen corresponding path program 1 times [2025-03-17 19:53:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665074094] [2025-03-17 19:53:10,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 19:53:10,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 19:53:10,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:53:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665074094] [2025-03-17 19:53:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665074094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689531083] [2025-03-17 19:53:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,811 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 240393649, now seen corresponding path program 1 times [2025-03-17 19:53:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563420040] [2025-03-17 19:53:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:53:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:53:10,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:53:10,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:10,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:10,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563420040] [2025-03-17 19:53:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563420040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:53:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:53:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:53:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539389246] [2025-03-17 19:53:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:53:10,845 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:10,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:53:10,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:53:10,846 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. cyclomatic complexity: 26 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:10,864 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2025-03-17 19:53:10,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2025-03-17 19:53:10,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-03-17 19:53:10,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 110 states and 129 transitions. [2025-03-17 19:53:10,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-17 19:53:10,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-17 19:53:10,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 129 transitions. [2025-03-17 19:53:10,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:10,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 129 transitions. [2025-03-17 19:53:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 129 transitions. [2025-03-17 19:53:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2025-03-17 19:53:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.1702127659574468) internal successors, (110), 93 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2025-03-17 19:53:10,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-03-17 19:53:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:53:10,871 INFO L432 stractBuchiCegarLoop]: Abstraction has 94 states and 110 transitions. [2025-03-17 19:53:10,871 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 19:53:10,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 110 transitions. [2025-03-17 19:53:10,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 19:53:10,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:10,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:10,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1] [2025-03-17 19:53:10,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2025-03-17 19:53:10,872 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:10,872 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:10,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1071108625, now seen corresponding path program 2 times [2025-03-17 19:53:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875007227] [2025-03-17 19:53:10,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:10,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:53:10,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:53:10,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:10,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:53:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875007227] [2025-03-17 19:53:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875007227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438387022] [2025-03-17 19:53:10,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:10,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:10,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:10,935 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-17 19:53:10,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 19:53:10,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 19:53:10,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:10,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:10,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:53:10,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:10,988 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:53:10,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 19:53:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438387022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 19:53:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100038537] [2025-03-17 19:53:11,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,050 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:11,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1724631757, now seen corresponding path program 2 times [2025-03-17 19:53:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661887332] [2025-03-17 19:53:11,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:53:11,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:53:11,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661887332] [2025-03-17 19:53:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661887332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141386912] [2025-03-17 19:53:11,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:53:11,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,084 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-17 19:53:11,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 19:53:11,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 19:53:11,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:53:11,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:11,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:11,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 19:53:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141386912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 19:53:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253914663] [2025-03-17 19:53:11,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,156 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:11,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:53:11,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:53:11,157 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. cyclomatic complexity: 24 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:11,188 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2025-03-17 19:53:11,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 229 transitions. [2025-03-17 19:53:11,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2025-03-17 19:53:11,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 190 states and 221 transitions. [2025-03-17 19:53:11,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-03-17 19:53:11,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-17 19:53:11,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 221 transitions. [2025-03-17 19:53:11,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:11,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190 states and 221 transitions. [2025-03-17 19:53:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 221 transitions. [2025-03-17 19:53:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 142. [2025-03-17 19:53:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.1408450704225352) internal successors, (162), 141 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2025-03-17 19:53:11,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 162 transitions. [2025-03-17 19:53:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:53:11,198 INFO L432 stractBuchiCegarLoop]: Abstraction has 142 states and 162 transitions. [2025-03-17 19:53:11,198 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 19:53:11,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 162 transitions. [2025-03-17 19:53:11,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-03-17 19:53:11,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:11,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:11,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 6, 4, 2, 1, 1] [2025-03-17 19:53:11,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2025-03-17 19:53:11,200 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:11,200 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:11,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 371602049, now seen corresponding path program 3 times [2025-03-17 19:53:11,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731063963] [2025-03-17 19:53:11,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-03-17 19:53:11,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-03-17 19:53:11,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 19:53:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:53:11,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731063963] [2025-03-17 19:53:11,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731063963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774813671] [2025-03-17 19:53:11,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:11,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,279 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-17 19:53:11,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-03-17 19:53:11,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 35 of 43 statements. [2025-03-17 19:53:11,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-17 19:53:11,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:53:11,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 109 proven. 55 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 19:53:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774813671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-17 19:53:11,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679857936] [2025-03-17 19:53:11,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,405 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:11,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1024904387, now seen corresponding path program 3 times [2025-03-17 19:53:11,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263301104] [2025-03-17 19:53:11,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:11,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-03-17 19:53:11,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-03-17 19:53:11,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:53:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:11,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263301104] [2025-03-17 19:53:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263301104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360705585] [2025-03-17 19:53:11,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:53:11,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,471 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-17 19:53:11,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 10 equivalence classes. [2025-03-17 19:53:11,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 32 of 40 statements. [2025-03-17 19:53:11,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 19:53:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:11,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 19:53:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360705585] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-17 19:53:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100864279] [2025-03-17 19:53:11,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,595 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:53:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:11,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:53:11,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:53:11,596 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. cyclomatic complexity: 28 Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:11,656 INFO L93 Difference]: Finished difference Result 278 states and 321 transitions. [2025-03-17 19:53:11,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 321 transitions. [2025-03-17 19:53:11,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2025-03-17 19:53:11,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 270 states and 313 transitions. [2025-03-17 19:53:11,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-03-17 19:53:11,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-03-17 19:53:11,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 313 transitions. [2025-03-17 19:53:11,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:11,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 313 transitions. [2025-03-17 19:53:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 313 transitions. [2025-03-17 19:53:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2025-03-17 19:53:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 1.1263157894736842) internal successors, (214), 189 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2025-03-17 19:53:11,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-03-17 19:53:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:53:11,668 INFO L432 stractBuchiCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-03-17 19:53:11,668 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 19:53:11,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 214 transitions. [2025-03-17 19:53:11,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2025-03-17 19:53:11,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:11,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:11,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 13, 13, 10, 4, 2, 1, 1] [2025-03-17 19:53:11,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2025-03-17 19:53:11,670 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:11,670 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:11,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1912229135, now seen corresponding path program 4 times [2025-03-17 19:53:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229703781] [2025-03-17 19:53:11,670 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-17 19:53:11,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 19:53:11,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 193 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 19:53:11,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:53:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229703781] [2025-03-17 19:53:11,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229703781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:53:11,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535797454] [2025-03-17 19:53:11,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:11,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:53:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:11,749 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:53:11,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-03-17 19:53:11,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-17 19:53:11,776 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 19:53:11,776 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 19:53:11,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:11,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:53:11,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 193 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 19:53:11,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:53:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 193 proven. 28 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 19:53:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535797454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:53:11,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:53:11,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 19:53:11,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278574592] [2025-03-17 19:53:11,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:53:11,881 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:53:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1853375571, now seen corresponding path program 4 times [2025-03-17 19:53:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935692595] [2025-03-17 19:53:11,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 19:53:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:11,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-17 19:53:11,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:53:11,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 19:53:11,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:11,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 19:53:11,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:53:11,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:11,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:11,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:12,129 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:12,130 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:12,130 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:12,130 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:12,130 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:53:12,130 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,130 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:12,130 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:12,130 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration12_Loop [2025-03-17 19:53:12,130 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:12,130 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:12,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,178 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:12,178 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:53:12,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,182 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-17 19:53:12,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,201 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 19:53:12,201 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 19:53:12,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 19:53:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,209 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-17 19:53:12,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:53:12,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-17 19:53:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,234 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-17 19:53:12,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:53:12,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:53:12,251 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:53:12,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-17 19:53:12,257 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:53:12,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:53:12,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:53:12,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:53:12,257 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:53:12,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:53:12,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:53:12,257 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration12_Loop [2025-03-17 19:53:12,257 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:53:12,257 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:53:12,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:53:12,305 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:53:12,305 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:53:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,321 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-17 19:53:12,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,335 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-17 19:53:12,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,337 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-17 19:53:12,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:53:12,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,363 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-17 19:53:12,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:53:12,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:53:12,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:53:12,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:53:12,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:53:12,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:53:12,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:53:12,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:53:12,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:53:12,396 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:53:12,396 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:53:12,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:53:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:53:12,398 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:53:12,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-17 19:53:12,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:53:12,401 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:53:12,401 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:53:12,401 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 7 Supporting invariants [] [2025-03-17 19:53:12,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,407 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:53:12,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 19:53:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 19:53:12,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:53:12,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:12,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 19:53:12,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 19:53:12,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:53:12,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:53:12,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:53:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 19:53:12,579 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-17 19:53:12,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190 states and 214 transitions. cyclomatic complexity: 32 Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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) [2025-03-17 19:53:12,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190 states and 214 transitions. cyclomatic complexity: 32. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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) Result 664 states and 754 transitions. Complement of second has 23 states. [2025-03-17 19:53:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2025-03-17 19:53:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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) [2025-03-17 19:53:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2025-03-17 19:53:12,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 59 letters. Loop has 56 letters. [2025-03-17 19:53:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 115 letters. Loop has 56 letters. [2025-03-17 19:53:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 54 transitions. Stem has 59 letters. Loop has 112 letters. [2025-03-17 19:53:12,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:53:12,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 754 transitions. [2025-03-17 19:53:12,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2025-03-17 19:53:12,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 546 states and 615 transitions. [2025-03-17 19:53:12,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2025-03-17 19:53:12,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2025-03-17 19:53:12,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 615 transitions. [2025-03-17 19:53:12,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:12,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 615 transitions. [2025-03-17 19:53:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 615 transitions. [2025-03-17 19:53:12,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 498. [2025-03-17 19:53:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 498 states have (on average 1.1365461847389557) internal successors, (566), 497 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 566 transitions. [2025-03-17 19:53:12,785 INFO L240 hiAutomatonCegarLoop]: Abstraction has 498 states and 566 transitions. [2025-03-17 19:53:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:53:12,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:53:12,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:53:12,786 INFO L87 Difference]: Start difference. First operand 498 states and 566 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:53:12,850 INFO L93 Difference]: Finished difference Result 309 states and 333 transitions. [2025-03-17 19:53:12,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 333 transitions. [2025-03-17 19:53:12,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2025-03-17 19:53:12,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 267 states and 291 transitions. [2025-03-17 19:53:12,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-03-17 19:53:12,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-03-17 19:53:12,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 291 transitions. [2025-03-17 19:53:12,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:53:12,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 291 transitions. [2025-03-17 19:53:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 291 transitions. [2025-03-17 19:53:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 262. [2025-03-17 19:53:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 262 states have (on average 1.0916030534351144) internal successors, (286), 261 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:53:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 286 transitions. [2025-03-17 19:53:12,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 262 states and 286 transitions. [2025-03-17 19:53:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:53:12,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 262 states and 286 transitions. [2025-03-17 19:53:12,860 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 19:53:12,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 286 transitions. [2025-03-17 19:53:12,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2025-03-17 19:53:12,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:53:12,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:53:12,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [21, 19, 19, 10, 10, 2, 1, 1] [2025-03-17 19:53:12,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2025-03-17 19:53:12,864 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:12,864 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume 0 == main_~i~0#1;main_~up~0#1 := 1;" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume !(10 == main_~i~0#1);" "assume !(0 == main_~i~0#1);" "assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1;" "assume 0 <= main_~i~0#1 && main_~i~0#1 <= 10;" "assume 10 == main_~i~0#1;main_~up~0#1 := 0;" [2025-03-17 19:53:12,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash -784565345, now seen corresponding path program 5 times [2025-03-17 19:53:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:12,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801706581] [2025-03-17 19:53:12,865 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:12,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:12,870 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 83 statements into 21 equivalence classes. [2025-03-17 19:53:12,878 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:53:12,878 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-17 19:53:12,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:12,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:53:12,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:53:12,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2069950373, now seen corresponding path program 5 times [2025-03-17 19:53:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803189376] [2025-03-17 19:53:12,888 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 19:53:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:12,892 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 20 equivalence classes. [2025-03-17 19:53:12,898 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:53:12,898 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 19:53:12,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:12,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 19:53:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 19:53:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:12,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:53:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1427152889, now seen corresponding path program 6 times [2025-03-17 19:53:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:53:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788738699] [2025-03-17 19:53:12,909 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 19:53:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:53:12,916 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 163 statements into 41 equivalence classes. [2025-03-17 19:53:12,932 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 19:53:12,932 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2025-03-17 19:53:12,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:12,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 19:53:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 19:53:12,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:12,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:53:13,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:53:13,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:53:13,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:53:13,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 19:53:13,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 19:53:13,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:53:13,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:53:13,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:53:13 BoogieIcfgContainer [2025-03-17 19:53:13,759 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:53:13,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:53:13,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:53:13,759 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:53:13,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:53:07" (3/4) ... [2025-03-17 19:53:13,761 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-17 19:53:13,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:53:13,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:53:13,819 INFO L158 Benchmark]: Toolchain (without parser) took 6509.61ms. Allocated memory is still 167.8MB. Free memory was 134.7MB in the beginning and 130.2MB in the end (delta: 4.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2025-03-17 19:53:13,819 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:13,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.52ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 124.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:53:13,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.07ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 123.7MB in the end (delta: 851.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:13,821 INFO L158 Benchmark]: Boogie Preprocessor took 16.66ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 122.8MB in the end (delta: 839.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:53:13,821 INFO L158 Benchmark]: IcfgBuilder took 170.31ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 113.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:53:13,822 INFO L158 Benchmark]: BuchiAutomizer took 6107.85ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 44.8MB in the end (delta: 68.0MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2025-03-17 19:53:13,822 INFO L158 Benchmark]: Witness Printer took 59.09ms. Allocated memory is still 167.8MB. Free memory was 44.8MB in the beginning and 130.2MB in the end (delta: -85.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:53:13,823 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.52ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 124.5MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.07ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 123.7MB in the end (delta: 851.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.66ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 122.8MB in the end (delta: 839.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 170.31ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 113.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6107.85ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 44.8MB in the end (delta: 68.0MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. * Witness Printer took 59.09ms. Allocated memory is still 167.8MB. Free memory was 44.8MB in the beginning and 130.2MB in the end (delta: -85.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (9 trivial, 7 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function ((long) -1 * i) and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function (7 + ((long) -1 * i)) and consists of 12 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 262 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 13 iterations. TraceHistogramMax:21. Analysis of lassos took 4.7s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 272 StatesRemovedByMinimization, 14 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 [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 171/364 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 103 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT3 conc0 concLT2 SILN0 SILU0 SILI4 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax171 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp86 dnf119 smp96 tf110 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i == 0) VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i == 10) VAL [i=9, up=0] [L15] COND FALSE !(i == 0) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=0] [L12] COND FALSE !(i == 10) VAL [i=8, up=0] [L15] COND FALSE !(i == 0) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=0] [L12] COND FALSE !(i == 10) VAL [i=7, up=0] [L15] COND FALSE !(i == 0) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=0] [L12] COND FALSE !(i == 10) VAL [i=6, up=0] [L15] COND FALSE !(i == 0) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=0] [L12] COND FALSE !(i == 10) VAL [i=5, up=0] [L15] COND FALSE !(i == 0) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=0] [L12] COND FALSE !(i == 10) VAL [i=4, up=0] [L15] COND FALSE !(i == 0) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=0] [L12] COND FALSE !(i == 10) VAL [i=3, up=0] [L15] COND FALSE !(i == 0) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=0] [L12] COND FALSE !(i == 10) VAL [i=2, up=0] [L15] COND FALSE !(i == 0) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=0] [L12] COND FALSE !(i == 10) VAL [i=1, up=0] [L15] COND FALSE !(i == 0) VAL [i=1, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=0, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i == 10) VAL [i=0, up=0] [L15] COND TRUE i == 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i == 10) VAL [i=1, up=1] [L15] COND FALSE !(i == 0) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=1] [L12] COND FALSE !(i == 10) VAL [i=2, up=1] [L15] COND FALSE !(i == 0) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=1] [L12] COND FALSE !(i == 10) VAL [i=3, up=1] [L15] COND FALSE !(i == 0) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=1] [L12] COND FALSE !(i == 10) VAL [i=4, up=1] [L15] COND FALSE !(i == 0) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=1] [L12] COND FALSE !(i == 10) VAL [i=5, up=1] [L15] COND FALSE !(i == 0) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=1] [L12] COND FALSE !(i == 10) VAL [i=6, up=1] [L15] COND FALSE !(i == 0) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=1] [L12] COND FALSE !(i == 10) VAL [i=7, up=1] [L15] COND FALSE !(i == 0) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=1] [L12] COND FALSE !(i == 10) VAL [i=8, up=1] [L15] COND FALSE !(i == 0) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=1] [L12] COND FALSE !(i == 10) VAL [i=9, up=1] [L15] COND FALSE !(i == 0) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=1] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=0] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] [L15] COND FALSE !(i == 0) VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=0] [L12] COND FALSE !(i == 10) VAL [i=9, up=0] [L15] COND FALSE !(i == 0) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=0] [L12] COND FALSE !(i == 10) VAL [i=8, up=0] [L15] COND FALSE !(i == 0) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=0] [L12] COND FALSE !(i == 10) VAL [i=7, up=0] [L15] COND FALSE !(i == 0) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=0] [L12] COND FALSE !(i == 10) VAL [i=6, up=0] [L15] COND FALSE !(i == 0) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=0] [L12] COND FALSE !(i == 10) VAL [i=5, up=0] [L15] COND FALSE !(i == 0) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=0] [L12] COND FALSE !(i == 10) VAL [i=4, up=0] [L15] COND FALSE !(i == 0) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=0] [L12] COND FALSE !(i == 10) VAL [i=3, up=0] [L15] COND FALSE !(i == 0) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=0] [L12] COND FALSE !(i == 10) VAL [i=2, up=0] [L15] COND FALSE !(i == 0) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=0] [L12] COND FALSE !(i == 10) VAL [i=1, up=0] [L15] COND FALSE !(i == 0) VAL [i=1, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=0, up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i == 10) VAL [i=0, up=0] [L15] COND TRUE i == 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i == 10) VAL [i=1, up=1] [L15] COND FALSE !(i == 0) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=1] [L12] COND FALSE !(i == 10) VAL [i=2, up=1] [L15] COND FALSE !(i == 0) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=1] [L12] COND FALSE !(i == 10) VAL [i=3, up=1] [L15] COND FALSE !(i == 0) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=1] [L12] COND FALSE !(i == 10) VAL [i=4, up=1] [L15] COND FALSE !(i == 0) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=1] [L12] COND FALSE !(i == 10) VAL [i=5, up=1] [L15] COND FALSE !(i == 0) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=6, up=1] [L12] COND FALSE !(i == 10) VAL [i=6, up=1] [L15] COND FALSE !(i == 0) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=7, up=1] [L12] COND FALSE !(i == 10) VAL [i=7, up=1] [L15] COND FALSE !(i == 0) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=8, up=1] [L12] COND FALSE !(i == 10) VAL [i=8, up=1] [L15] COND FALSE !(i == 0) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=9, up=1] [L12] COND FALSE !(i == 10) VAL [i=9, up=1] [L15] COND FALSE !(i == 0) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=10, up=1] [L12] COND TRUE i == 10 [L13] up = 0 VAL [i=10, up=0] Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-17 19:53:13,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-03-17 19:53:14,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-03-17 19:53:14,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-17 19:53:15,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)