./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../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.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:07:37,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:07:37,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-23 02:07:37,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:07:37,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:07:37,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:07:37,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:07:37,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:07:37,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:07:37,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:07:37,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:07:37,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:07:37,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:07:37,392 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:07:37,392 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:07:37,392 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:07:37,392 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:07:37,393 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:07:37,393 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:07:37,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:07:37,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:07:37,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:07:37,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:07:37,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:07:37,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:07:37,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:07:37,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:07:37,398 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:07:37,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:07:37,398 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:07:37,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:07:37,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:07:37,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:07:37,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:07:37,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:07:37,400 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:07:37,400 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 [2024-11-23 02:07:37,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:07:37,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:07:37,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:07:37,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:07:37,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:07:37,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-11-23 02:07:38,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:07:38,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:07:38,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-11-23 02:07:39,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24345e934/34a33db9e0524dcea8fb1f53872ccf02/FLAG915121e33 [2024-11-23 02:07:39,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24345e934/34a33db9e0524dcea8fb1f53872ccf02 [2024-11-23 02:07:39,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:07:39,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:07:39,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:07:39,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:07:39,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:07:39,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bea926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39, skipping insertion in model container [2024-11-23 02:07:39,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:07:39,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:07:39,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:07:39,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:07:39,651 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:07:39,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39 WrapperNode [2024-11-23 02:07:39,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:07:39,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:07:39,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:07:39,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:07:39,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,678 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-23 02:07:39,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:07:39,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:07:39,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:07:39,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:07:39,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,695 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-23 02:07:39,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:07:39,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:07:39,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:07:39,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:07:39,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (1/1) ... [2024-11-23 02:07:39,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:39,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:39,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:07:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:07:39,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:07:39,874 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:07:39,877 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:07:39,961 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-23 02:07:39,961 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:07:39,974 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:07:39,974 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-23 02:07:39,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:39 BoogieIcfgContainer [2024-11-23 02:07:39,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:07:39,976 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:07:39,976 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:07:39,979 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:07:39,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:07:39,980 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:07:39" (1/3) ... [2024-11-23 02:07:39,981 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33698f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:07:39, skipping insertion in model container [2024-11-23 02:07:39,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:07:39,981 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:07:39" (2/3) ... [2024-11-23 02:07:39,982 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33698f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:07:39, skipping insertion in model container [2024-11-23 02:07:39,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:07:39,982 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:39" (3/3) ... [2024-11-23 02:07:39,984 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2024-11-23 02:07:40,026 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:07:40,026 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:07:40,026 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:07:40,026 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:07:40,026 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:07:40,026 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:07:40,026 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:07:40,027 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:07:40,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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) [2024-11-23 02:07:40,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-23 02:07:40,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:40,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:40,045 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:07:40,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:40,045 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:07:40,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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) [2024-11-23 02:07:40,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-23 02:07:40,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:40,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:40,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-23 02:07:40,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:40,052 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true 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; 4#L18-1true [2024-11-23 02:07:40,053 INFO L747 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10#L12true assume !(10 == main_~i~0#1); 2#L12-2true assume 0 == main_~i~0#1;main_~up~0#1 := 1; 7#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2024-11-23 02:07:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-23 02:07:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:40,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757765446] [2024-11-23 02:07:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:40,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-23 02:07:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655479902] [2024-11-23 02:07:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:40,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,174 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-11-23 02:07:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699407880] [2024-11-23 02:07:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:40,245 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:40,245 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:40,245 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:40,245 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:40,245 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:40,246 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,246 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:40,246 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:40,246 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-11-23 02:07:40,246 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:40,247 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:40,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,347 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:40,348 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:40,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:40,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-23 02:07:40,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:40,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:40,371 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:40,371 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: [] [2024-11-23 02:07:40,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:40,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-23 02:07:40,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:40,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:40,400 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:40,400 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: [] [2024-11-23 02:07:40,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:40,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:40,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-23 02:07:40,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:40,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:40,427 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:40,427 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: [] [2024-11-23 02:07:40,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-23 02:07:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-23 02:07:40,438 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:40,438 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:40,457 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 [2024-11-23 02:07:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:40,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-23 02:07:40,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:40,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:40,474 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:40,480 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 [2024-11-23 02:07:40,480 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:40,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:40,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:40,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:40,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:40,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:40,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:40,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-11-23 02:07:40,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:40,481 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:40,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:40,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:40,555 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:40,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,558 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) [2024-11-23 02:07:40,559 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 [2024-11-23 02:07:40,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:40,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:40,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:40,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:40,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:40,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:40,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:40,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:40,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-23 02:07:40,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,591 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) [2024-11-23 02:07:40,592 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 [2024-11-23 02:07:40,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:40,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:40,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:40,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:40,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:40,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:40,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:40,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:40,618 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 [2024-11-23 02:07:40,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,619 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) [2024-11-23 02:07:40,621 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 [2024-11-23 02:07:40,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:40,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:40,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:40,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:40,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:40,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:40,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:40,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:40,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:40,637 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:40,638 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:40,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:40,663 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) [2024-11-23 02:07:40,664 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 [2024-11-23 02:07:40,665 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:40,665 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:40,665 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:40,666 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 [] [2024-11-23 02:07:40,672 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 [2024-11-23 02:07:40,674 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:40,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:40,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:40,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:40,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:40,761 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:40,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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) 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) [2024-11-23 02:07:40,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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). 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 28 states and 45 transitions. Complement of second has 8 states. [2024-11-23 02:07:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:40,830 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) [2024-11-23 02:07:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-23 02:07:40,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-23 02:07:40,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:40,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-23 02:07:40,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:40,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-23 02:07:40,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:40,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-11-23 02:07:40,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-23 02:07:40,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-11-23 02:07:40,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-23 02:07:40,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-23 02:07:40,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-11-23 02:07:40,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:40,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-11-23 02:07:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-11-23 02:07:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-23 02:07:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-11-23 02:07:40,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-23 02:07:40,883 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-23 02:07:40,885 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:07:40,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-11-23 02:07:40,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-23 02:07:40,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:40,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:40,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:07:40,891 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:40,891 INFO L745 eck$LassoCheckResult]: Stem: 92#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 93#L-1 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; 97#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 89#L12 [2024-11-23 02:07:40,891 INFO L747 eck$LassoCheckResult]: Loop: 89#L12 assume !(10 == main_~i~0#1); 98#L12-2 assume !(0 == main_~i~0#1); 99#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 88#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 89#L12 [2024-11-23 02:07:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-23 02:07:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361867066] [2024-11-23 02:07:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:40,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-23 02:07:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:40,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-11-23 02:07:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:40,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275649725] [2024-11-23 02:07:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:40,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:40,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-11-23 02:07:40,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:40,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236874685] [2024-11-23 02:07:40,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:40,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:41,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236874685] [2024-11-23 02:07:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236874685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:07:41,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:07:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:07:41,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647002398] [2024-11-23 02:07:41,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:07:41,070 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:41,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:41,071 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:41,071 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:41,071 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:41,071 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:41,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:41,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-11-23 02:07:41,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:41,073 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:41,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,166 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:41,166 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,167 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) [2024-11-23 02:07:41,170 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 [2024-11-23 02:07:41,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:41,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:41,190 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:41,190 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: [] [2024-11-23 02:07:41,200 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 [2024-11-23 02:07:41,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,202 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) [2024-11-23 02:07:41,203 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 [2024-11-23 02:07:41,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:41,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:41,224 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 [2024-11-23 02:07:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,230 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) [2024-11-23 02:07:41,231 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 [2024-11-23 02:07:41,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:41,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:41,269 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:41,273 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 [2024-11-23 02:07:41,274 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:41,274 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:41,274 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:41,274 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:41,274 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:41,274 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,274 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:41,274 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:41,274 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-11-23 02:07:41,274 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:41,274 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:41,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,359 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:41,359 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,361 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) [2024-11-23 02:07:41,363 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 [2024-11-23 02:07:41,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:41,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:41,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:41,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:41,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:41,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:41,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:41,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:41,388 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 [2024-11-23 02:07:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,391 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) [2024-11-23 02:07:41,393 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 [2024-11-23 02:07:41,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:41,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:41,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:41,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:41,405 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:07:41,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:41,407 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-23 02:07:41,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:41,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:41,413 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:41,413 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,416 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) [2024-11-23 02:07:41,417 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 [2024-11-23 02:07:41,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:41,418 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:41,418 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:41,418 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 [] [2024-11-23 02:07:41,424 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 [2024-11-23 02:07:41,425 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:41,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:41,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:41,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:41,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:41,486 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:41,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 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) [2024-11-23 02:07:41,517 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. 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 28 states and 43 transitions. Complement of second has 7 states. [2024-11-23 02:07:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:41,518 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) [2024-11-23 02:07:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-23 02:07:41,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-23 02:07:41,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:41,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-23 02:07:41,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:41,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-23 02:07:41,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:41,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2024-11-23 02:07:41,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-23 02:07:41,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 35 transitions. [2024-11-23 02:07:41,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:07:41,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-23 02:07:41,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 35 transitions. [2024-11-23 02:07:41,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:41,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2024-11-23 02:07:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 35 transitions. [2024-11-23 02:07:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-23 02:07:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2024-11-23 02:07:41,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 34 transitions. [2024-11-23 02:07:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:07:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:07:41,530 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:41,543 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2024-11-23 02:07:41,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 52 transitions. [2024-11-23 02:07:41,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 02:07:41,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 46 transitions. [2024-11-23 02:07:41,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-23 02:07:41,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-23 02:07:41,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 46 transitions. [2024-11-23 02:07:41,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:41,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 46 transitions. [2024-11-23 02:07:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 46 transitions. [2024-11-23 02:07:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-23 02:07:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-11-23 02:07:41,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-23 02:07:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:07:41,549 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-23 02:07:41,549 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:07:41,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2024-11-23 02:07:41,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-23 02:07:41,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:41,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:41,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-23 02:07:41,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:41,551 INFO L745 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 236#L-1 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; 239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 244#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 226#L12-2 assume !(0 == main_~i~0#1); 228#L15-1 [2024-11-23 02:07:41,551 INFO L747 eck$LassoCheckResult]: Loop: 228#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 237#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 248#L12 assume !(10 == main_~i~0#1); 246#L12-2 assume !(0 == main_~i~0#1); 228#L15-1 [2024-11-23 02:07:41,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-11-23 02:07:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995268392] [2024-11-23 02:07:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-11-23 02:07:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369503008] [2024-11-23 02:07:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-11-23 02:07:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628488757] [2024-11-23 02:07:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:41,602 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:41,602 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:41,602 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:41,602 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:41,602 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:41,602 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,602 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:41,602 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:41,602 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-11-23 02:07:41,602 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:41,602 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:41,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,667 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:41,667 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:41,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,670 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) [2024-11-23 02:07:41,670 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 [2024-11-23 02:07:41,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:41,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:41,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-23 02:07:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,691 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) [2024-11-23 02:07:41,692 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 [2024-11-23 02:07:41,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:41,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:41,755 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:41,759 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 [2024-11-23 02:07:41,760 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:41,760 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:41,760 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:41,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:41,760 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:41,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:41,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:41,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-11-23 02:07:41,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:41,760 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:41,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,816 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:41,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:41,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,818 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) [2024-11-23 02:07:41,818 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 [2024-11-23 02:07:41,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:41,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:41,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:41,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:41,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:41,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:41,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:41,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:41,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:41,835 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:41,835 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:07:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:41,837 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) [2024-11-23 02:07:41,839 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 [2024-11-23 02:07:41,843 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:41,843 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:41,844 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:41,844 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 [] [2024-11-23 02:07:41,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:41,850 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:41,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:41,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:41,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:41,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:41,905 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 [2024-11-23 02:07:41,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 45 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:41,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 45 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 104 transitions. Complement of second has 7 states. [2024-11-23 02:07:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-23 02:07:41,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-23 02:07:41,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:41,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-23 02:07:41,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:41,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-23 02:07:41,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:41,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 104 transitions. [2024-11-23 02:07:41,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-23 02:07:41,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 98 transitions. [2024-11-23 02:07:41,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-23 02:07:41,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-23 02:07:41,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 98 transitions. [2024-11-23 02:07:41,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:41,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 98 transitions. [2024-11-23 02:07:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 98 transitions. [2024-11-23 02:07:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-23 02:07:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 55 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 94 transitions. [2024-11-23 02:07:41,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-11-23 02:07:41,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-11-23 02:07:41,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:07:41,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 94 transitions. [2024-11-23 02:07:41,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-23 02:07:41,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:41,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:41,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:07:41,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:41,949 INFO L745 eck$LassoCheckResult]: Stem: 379#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 380#L-1 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; 384#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 412#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 408#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 407#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 404#L18-1 [2024-11-23 02:07:41,949 INFO L747 eck$LassoCheckResult]: Loop: 404#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 397#L12 assume !(10 == main_~i~0#1); 394#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 395#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 404#L18-1 [2024-11-23 02:07:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-11-23 02:07:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:41,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942347685] [2024-11-23 02:07:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942347685] [2024-11-23 02:07:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942347685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:07:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:07:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:07:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769132834] [2024-11-23 02:07:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:07:41,966 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:41,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 2 times [2024-11-23 02:07:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:41,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613443854] [2024-11-23 02:07:41,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:41,970 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:07:41,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:41,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:41,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:41,992 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:41,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:41,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:41,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:41,992 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:41,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:41,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:41,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:41,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-11-23 02:07:41,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:41,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:41,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:41,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,042 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:42,042 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:42,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,045 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) [2024-11-23 02:07:42,046 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 [2024-11-23 02:07:42,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:42,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:42,065 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:42,065 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: [] [2024-11-23 02:07:42,071 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 [2024-11-23 02:07:42,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,073 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) [2024-11-23 02:07:42,074 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 [2024-11-23 02:07:42,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:42,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:42,089 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:42,090 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: [] [2024-11-23 02:07:42,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-23 02:07:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,098 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) [2024-11-23 02:07:42,099 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 [2024-11-23 02:07:42,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:42,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:42,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,118 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) [2024-11-23 02:07:42,119 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 [2024-11-23 02:07:42,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:42,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:42,131 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:42,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,138 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:42,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:42,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:42,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:42,138 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:42,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:42,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:42,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-11-23 02:07:42,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:42,138 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:42,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,179 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:42,179 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,180 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) [2024-11-23 02:07:42,181 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 [2024-11-23 02:07:42,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:42,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:42,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:42,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:42,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:42,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:42,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:42,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:42,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,207 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) [2024-11-23 02:07:42,209 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 [2024-11-23 02:07:42,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:42,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:42,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:42,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:42,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:42,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:42,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:42,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:42,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:42,224 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:42,224 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:42,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,226 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) [2024-11-23 02:07:42,227 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 [2024-11-23 02:07:42,228 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:42,228 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:42,228 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:42,228 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 [] [2024-11-23 02:07:42,234 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 [2024-11-23 02:07:42,235 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:42,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,289 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:42,289 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 94 transitions. cyclomatic complexity: 44 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-23 02:07:42,320 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 94 transitions. cyclomatic complexity: 44. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Result 116 states and 190 transitions. Complement of second has 7 states. [2024-11-23 02:07:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-23 02:07:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-23 02:07:42,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-23 02:07:42,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-23 02:07:42,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-23 02:07:42,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 190 transitions. [2024-11-23 02:07:42,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-23 02:07:42,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 107 states and 175 transitions. [2024-11-23 02:07:42,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-23 02:07:42,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-11-23 02:07:42,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 175 transitions. [2024-11-23 02:07:42,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:42,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 175 transitions. [2024-11-23 02:07:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 175 transitions. [2024-11-23 02:07:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2024-11-23 02:07:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.6770833333333333) internal successors, (161), 95 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2024-11-23 02:07:42,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 161 transitions. [2024-11-23 02:07:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:07:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:07:42,338 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2024-11-23 02:07:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:42,347 INFO L93 Difference]: Finished difference Result 107 states and 163 transitions. [2024-11-23 02:07:42,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 163 transitions. [2024-11-23 02:07:42,348 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2024-11-23 02:07:42,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 153 transitions. [2024-11-23 02:07:42,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-23 02:07:42,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-23 02:07:42,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 153 transitions. [2024-11-23 02:07:42,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:42,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-23 02:07:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 153 transitions. [2024-11-23 02:07:42,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-23 02:07:42,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-23 02:07:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 95 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-11-23 02:07:42,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-23 02:07:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:07:42,377 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-23 02:07:42,377 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:07:42,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 148 transitions. [2024-11-23 02:07:42,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-23 02:07:42,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:42,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:42,379 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2024-11-23 02:07:42,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:42,379 INFO L745 eck$LassoCheckResult]: Stem: 806#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 807#L-1 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; 801#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 803#L12 assume !(10 == main_~i~0#1); 809#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 863#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 858#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 854#L12 assume !(10 == main_~i~0#1); 848#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 846#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 817#L18-1 [2024-11-23 02:07:42,379 INFO L747 eck$LassoCheckResult]: Loop: 817#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 839#L12 assume !(10 == main_~i~0#1); 818#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 816#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 817#L18-1 [2024-11-23 02:07:42,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1506873443, now seen corresponding path program 1 times [2024-11-23 02:07:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043594278] [2024-11-23 02:07:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:42,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043594278] [2024-11-23 02:07:42,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043594278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:07:42,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:07:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:07:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426524305] [2024-11-23 02:07:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:07:42,397 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 3 times [2024-11-23 02:07:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184936933] [2024-11-23 02:07:42,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:42,404 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:07:42,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:42,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:42,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:42,425 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:42,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:42,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:42,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:42,425 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:42,425 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,426 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:42,426 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:42,426 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-11-23 02:07:42,426 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:42,426 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:42,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,463 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:42,463 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:42,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,465 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) [2024-11-23 02:07:42,466 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 [2024-11-23 02:07:42,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:42,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:42,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,485 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:42,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-23 02:07:42,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:42,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:42,497 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:42,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-23 02:07:42,503 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:42,503 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:42,503 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:42,503 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:42,503 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:42,503 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,503 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:42,503 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:42,503 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-11-23 02:07:42,503 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:42,503 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:42,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,539 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:42,539 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,542 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) [2024-11-23 02:07:42,543 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 [2024-11-23 02:07:42,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:42,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:42,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:42,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:42,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:42,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:42,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:42,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:42,564 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 [2024-11-23 02:07:42,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,565 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) [2024-11-23 02:07:42,565 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 [2024-11-23 02:07:42,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:42,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:42,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:42,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:42,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:42,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:42,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:42,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:42,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:42,580 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:42,580 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:42,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,582 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) [2024-11-23 02:07:42,584 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 [2024-11-23 02:07:42,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:42,584 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:42,584 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:42,584 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 [] [2024-11-23 02:07:42,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:42,591 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:42,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,631 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:42,631 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61 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) [2024-11-23 02:07:42,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61. 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 147 states and 221 transitions. Complement of second has 7 states. [2024-11-23 02:07:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:42,654 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) [2024-11-23 02:07:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-23 02:07:42,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-23 02:07:42,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,654 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:42,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,700 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:42,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61 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) [2024-11-23 02:07:42,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61. 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 147 states and 221 transitions. Complement of second has 7 states. [2024-11-23 02:07:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:42,724 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) [2024-11-23 02:07:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-23 02:07:42,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-23 02:07:42,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,724 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,778 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:42,778 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61 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) [2024-11-23 02:07:42,808 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61. 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 161 states and 250 transitions. Complement of second has 6 states. [2024-11-23 02:07:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:42,810 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) [2024-11-23 02:07:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-23 02:07:42,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-23 02:07:42,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-23 02:07:42,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-23 02:07:42,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:42,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 250 transitions. [2024-11-23 02:07:42,812 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2024-11-23 02:07:42,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 119 states and 180 transitions. [2024-11-23 02:07:42,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-23 02:07:42,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-23 02:07:42,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 180 transitions. [2024-11-23 02:07:42,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:42,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-23 02:07:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 180 transitions. [2024-11-23 02:07:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2024-11-23 02:07:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 76 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-23 02:07:42,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-23 02:07:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:42,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 02:07:42,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 02:07:42,818 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2024-11-23 02:07:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:42,830 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-11-23 02:07:42,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2024-11-23 02:07:42,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-23 02:07:42,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 68 transitions. [2024-11-23 02:07:42,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-23 02:07:42,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-23 02:07:42,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 68 transitions. [2024-11-23 02:07:42,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:42,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-23 02:07:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 68 transitions. [2024-11-23 02:07:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-23 02:07:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-11-23 02:07:42,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-23 02:07:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 02:07:42,835 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-23 02:07:42,835 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:07:42,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2024-11-23 02:07:42,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-23 02:07:42,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:42,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:42,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:42,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:42,839 INFO L745 eck$LassoCheckResult]: Stem: 1655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1656#L-1 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; 1659#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1679#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 1669#L12-2 assume !(0 == main_~i~0#1); 1657#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1658#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1677#L12 assume !(10 == main_~i~0#1); 1676#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1646#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1672#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1670#L12 [2024-11-23 02:07:42,839 INFO L747 eck$LassoCheckResult]: Loop: 1670#L12 assume !(10 == main_~i~0#1); 1668#L12-2 assume !(0 == main_~i~0#1); 1665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1666#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1670#L12 [2024-11-23 02:07:42,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1179049836, now seen corresponding path program 1 times [2024-11-23 02:07:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:42,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752622021] [2024-11-23 02:07:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752622021] [2024-11-23 02:07:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752622021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547712430] [2024-11-23 02:07:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:42,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:42,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:42,876 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:42,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-23 02:07:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:42,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 02:07:42,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547712430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:42,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-23 02:07:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528435353] [2024-11-23 02:07:42,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:42,925 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 2 times [2024-11-23 02:07:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479046866] [2024-11-23 02:07:42,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:42,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:07:42,929 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:42,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:42,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:42,960 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:42,961 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:42,961 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:42,961 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:42,961 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:42,961 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:42,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:42,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:42,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-11-23 02:07:42,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:42,961 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:42,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:42,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:43,022 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,023 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) [2024-11-23 02:07:43,024 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 [2024-11-23 02:07:43,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:43,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:43,041 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 [2024-11-23 02:07:43,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,042 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) [2024-11-23 02:07:43,043 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 [2024-11-23 02:07:43,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:43,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:43,079 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:43,083 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 [2024-11-23 02:07:43,084 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:43,084 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:43,084 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:43,084 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:43,084 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:43,084 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,084 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:43,084 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:43,084 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-11-23 02:07:43,084 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:43,084 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:43,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,146 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:43,146 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:43,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,150 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) [2024-11-23 02:07:43,151 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 [2024-11-23 02:07:43,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:43,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:43,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:43,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:43,163 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:07:43,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:43,164 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-23 02:07:43,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:43,166 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:43,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:43,169 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-23 02:07:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,171 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) [2024-11-23 02:07:43,172 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 [2024-11-23 02:07:43,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:43,172 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:43,172 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:43,173 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 [] [2024-11-23 02:07:43,178 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 [2024-11-23 02:07:43,179 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:43,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:43,217 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:43,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:43,235 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 66 states and 90 transitions. Complement of second has 7 states. [2024-11-23 02:07:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-23 02:07:43,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-23 02:07:43,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,237 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:43,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:43,274 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:43,274 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:43,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 66 states and 90 transitions. Complement of second has 7 states. [2024-11-23 02:07:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-23 02:07:43,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-23 02:07:43,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,291 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:43,329 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:43,329 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:43,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 86 states and 124 transitions. Complement of second has 6 states. [2024-11-23 02:07:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-23 02:07:43,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-23 02:07:43,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-23 02:07:43,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 8 letters. [2024-11-23 02:07:43,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 124 transitions. [2024-11-23 02:07:43,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-23 02:07:43,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 56 states and 76 transitions. [2024-11-23 02:07:43,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-23 02:07:43,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-23 02:07:43,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2024-11-23 02:07:43,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:43,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-23 02:07:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2024-11-23 02:07:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-11-23 02:07:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 41 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-23 02:07:43,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-23 02:07:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:43,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:07:43,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:07:43,357 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:43,388 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-11-23 02:07:43,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2024-11-23 02:07:43,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-23 02:07:43,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 72 states and 93 transitions. [2024-11-23 02:07:43,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-23 02:07:43,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-23 02:07:43,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2024-11-23 02:07:43,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:43,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-11-23 02:07:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2024-11-23 02:07:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-11-23 02:07:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-11-23 02:07:43,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-23 02:07:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:07:43,394 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-23 02:07:43,394 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:07:43,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 85 transitions. [2024-11-23 02:07:43,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-23 02:07:43,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:43,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:43,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:07:43,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:43,395 INFO L745 eck$LassoCheckResult]: Stem: 2280#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2281#L-1 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; 2285#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2292#L12 assume !(10 == main_~i~0#1); 2272#L12-2 assume !(0 == main_~i~0#1); 2273#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2305#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2286#L12 assume !(10 == main_~i~0#1); 2287#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2330#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2332#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2303#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2302#L12-2 [2024-11-23 02:07:43,395 INFO L747 eck$LassoCheckResult]: Loop: 2302#L12-2 assume !(0 == main_~i~0#1); 2337#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2336#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2301#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2302#L12-2 [2024-11-23 02:07:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 2 times [2024-11-23 02:07:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607411283] [2024-11-23 02:07:43,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:43,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:43,401 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 02:07:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607411283] [2024-11-23 02:07:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607411283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:07:43,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:07:43,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 02:07:43,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398423297] [2024-11-23 02:07:43,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:07:43,427 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-11-23 02:07:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019698860] [2024-11-23 02:07:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:43,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:43,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:43,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-23 02:07:43,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:43,488 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:43,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:43,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:43,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:43,488 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:43,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:43,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:43,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-11-23 02:07:43,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:43,488 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:43,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,534 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:43,534 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:43,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,536 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-23 02:07:43,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:43,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:43,555 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:43,556 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:43,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-23 02:07:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,566 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-23 02:07:43,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:43,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:43,585 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:43,586 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: [] [2024-11-23 02:07:43,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:43,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,592 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-23 02:07:43,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:43,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:43,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-23 02:07:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,611 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-23 02:07:43,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:43,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:43,628 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:43,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:43,634 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:43,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:43,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:43,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:43,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:43,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:43,634 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:43,634 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-11-23 02:07:43,634 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:43,634 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:43,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:43,695 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:43,695 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,696 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-23 02:07:43,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:43,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:43,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:43,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:43,709 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-23 02:07:43,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:43,709 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-23 02:07:43,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:43,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:43,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,720 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) [2024-11-23 02:07:43,721 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 [2024-11-23 02:07:43,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:43,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:43,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:43,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:43,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:43,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:43,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:43,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:43,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:43,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,743 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) [2024-11-23 02:07:43,743 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 [2024-11-23 02:07:43,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:43,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:43,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:43,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:43,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:43,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:43,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:43,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:43,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:43,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,767 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) [2024-11-23 02:07:43,768 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 [2024-11-23 02:07:43,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:43,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:43,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:43,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:43,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:43,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:43,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:43,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:43,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:43,785 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:43,785 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:07:43,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:43,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,787 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) [2024-11-23 02:07:43,788 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 [2024-11-23 02:07:43,789 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:43,789 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:43,789 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:43,789 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 [] [2024-11-23 02:07:43,794 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 [2024-11-23 02:07:43,796 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:43,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:43,836 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:43,836 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 85 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 85 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 160 states and 209 transitions. Complement of second has 7 states. [2024-11-23 02:07:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-23 02:07:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-23 02:07:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-11-23 02:07:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-11-23 02:07:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:43,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 209 transitions. [2024-11-23 02:07:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-23 02:07:43,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 126 states and 161 transitions. [2024-11-23 02:07:43,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-23 02:07:43,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-23 02:07:43,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 161 transitions. [2024-11-23 02:07:43,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:43,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-11-23 02:07:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 161 transitions. [2024-11-23 02:07:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-11-23 02:07:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 119 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2024-11-23 02:07:43,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2024-11-23 02:07:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:07:43,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:07:43,866 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2024-11-23 02:07:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:43,884 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2024-11-23 02:07:43,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 174 transitions. [2024-11-23 02:07:43,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-23 02:07:43,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 174 transitions. [2024-11-23 02:07:43,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-23 02:07:43,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-23 02:07:43,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 174 transitions. [2024-11-23 02:07:43,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:43,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 174 transitions. [2024-11-23 02:07:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 174 transitions. [2024-11-23 02:07:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-23 02:07:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 116 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2024-11-23 02:07:43,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-23 02:07:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:07:43,892 INFO L425 stractBuchiCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-23 02:07:43,892 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:07:43,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 147 transitions. [2024-11-23 02:07:43,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-23 02:07:43,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:43,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:43,893 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2024-11-23 02:07:43,893 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-23 02:07:43,894 INFO L745 eck$LassoCheckResult]: Stem: 2835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2836#L-1 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; 2840#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2848#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2827#L12-2 assume !(0 == main_~i~0#1); 2828#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2942#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2843#L12 assume !(10 == main_~i~0#1); 2829#L12-2 assume !(0 == main_~i~0#1); 2830#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2839#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2941#L12 assume !(10 == main_~i~0#1); 2940#L12-2 assume !(0 == main_~i~0#1); 2939#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2937#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2936#L12 assume !(10 == main_~i~0#1); 2935#L12-2 assume !(0 == main_~i~0#1); 2933#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2934#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2938#L12 assume !(10 == main_~i~0#1); 2842#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2902#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2900#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2899#L12 assume !(10 == main_~i~0#1); 2877#L12-2 assume !(0 == main_~i~0#1); 2879#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2878#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2876#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2850#L12-2 [2024-11-23 02:07:43,894 INFO L747 eck$LassoCheckResult]: Loop: 2850#L12-2 assume !(0 == main_~i~0#1); 2845#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2846#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2874#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2850#L12-2 [2024-11-23 02:07:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 3 times [2024-11-23 02:07:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:43,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589419087] [2024-11-23 02:07:43,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:43,904 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 02:07:43,904 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:07:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589419087] [2024-11-23 02:07:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589419087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803291640] [2024-11-23 02:07:43,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:43,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:43,943 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:43,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-23 02:07:43,961 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 02:07:43,962 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:43,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:43,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:07:43,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 02:07:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803291640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:44,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-23 02:07:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635966750] [2024-11-23 02:07:44,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:44,003 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:07:44,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-11-23 02:07:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542836801] [2024-11-23 02:07:44,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:44,006 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:07:44,006 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:44,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:44,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:44,036 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:44,036 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:44,036 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:44,036 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:44,036 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:44,036 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,036 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:44,036 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:44,036 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-11-23 02:07:44,036 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:44,036 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:44,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:44,086 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:44,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,088 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) [2024-11-23 02:07:44,089 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 [2024-11-23 02:07:44,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:44,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:44,106 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-23 02:07:44,107 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-23 02:07:44,112 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 [2024-11-23 02:07:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,114 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-23 02:07:44,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:44,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:44,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:44,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,136 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-23 02:07:44,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:44,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:44,149 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:44,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:44,155 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:44,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:44,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:44,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:44,155 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:44,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:44,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:44,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-11-23 02:07:44,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:44,155 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:44,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:44,221 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:44,221 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,225 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-23 02:07:44,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:44,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:44,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:44,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:44,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:44,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:07:44,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:07:44,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:07:44,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:44,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,249 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-23 02:07:44,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:44,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:44,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:44,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:44,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:44,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:44,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:44,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:44,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:44,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:44,270 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:07:44,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:44,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,272 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-23 02:07:44,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:44,273 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:44,274 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:44,274 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 [] [2024-11-23 02:07:44,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:44,280 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:44,332 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:44,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:44,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 164 states and 204 transitions. Complement of second has 7 states. [2024-11-23 02:07:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-23 02:07:44,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-23 02:07:44,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:44,350 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:44,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:44,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:44,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:44,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 198 states and 239 transitions. Complement of second has 7 states. [2024-11-23 02:07:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-23 02:07:44,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-23 02:07:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:44,427 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:07:44,496 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-23 02:07:44,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:44,516 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Result 176 states and 219 transitions. Complement of second has 8 states. [2024-11-23 02:07:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2024-11-23 02:07:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-23 02:07:44,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-23 02:07:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:44,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-23 02:07:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:44,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2024-11-23 02:07:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:44,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 219 transitions. [2024-11-23 02:07:44,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-23 02:07:44,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 121 states and 151 transitions. [2024-11-23 02:07:44,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-23 02:07:44,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-23 02:07:44,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 151 transitions. [2024-11-23 02:07:44,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:44,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 151 transitions. [2024-11-23 02:07:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 151 transitions. [2024-11-23 02:07:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2024-11-23 02:07:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.25) internal successors, (95), 75 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-23 02:07:44,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-23 02:07:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:44,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 02:07:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-23 02:07:44,521 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:44,570 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2024-11-23 02:07:44,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 161 transitions. [2024-11-23 02:07:44,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2024-11-23 02:07:44,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 161 transitions. [2024-11-23 02:07:44,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:07:44,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:07:44,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 161 transitions. [2024-11-23 02:07:44,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:44,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 161 transitions. [2024-11-23 02:07:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 161 transitions. [2024-11-23 02:07:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2024-11-23 02:07:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 91 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) [2024-11-23 02:07:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2024-11-23 02:07:44,573 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-11-23 02:07:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 02:07:44,575 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-11-23 02:07:44,575 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:07:44,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 111 transitions. [2024-11-23 02:07:44,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2024-11-23 02:07:44,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:44,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:44,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-23 02:07:44,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2024-11-23 02:07:44,576 INFO L745 eck$LassoCheckResult]: Stem: 4192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4193#L-1 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; 4187#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(10 == main_~i~0#1); 4212#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4202#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 [2024-11-23 02:07:44,576 INFO L747 eck$LassoCheckResult]: Loop: 4204#L12 assume !(10 == main_~i~0#1); 4241#L12-2 assume !(0 == main_~i~0#1); 4240#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4238#L12 assume !(10 == main_~i~0#1); 4237#L12-2 assume !(0 == main_~i~0#1); 4236#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4235#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4234#L12 assume !(10 == main_~i~0#1); 4233#L12-2 assume !(0 == main_~i~0#1); 4232#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4231#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4230#L12 assume !(10 == main_~i~0#1); 4229#L12-2 assume !(0 == main_~i~0#1); 4228#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4227#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4226#L12 assume !(10 == main_~i~0#1); 4206#L12-2 assume !(0 == main_~i~0#1); 4209#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4208#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4205#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4207#L12-2 assume !(0 == main_~i~0#1); 4263#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4262#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4261#L12 assume !(10 == main_~i~0#1); 4260#L12-2 assume !(0 == main_~i~0#1); 4259#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4258#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4257#L12 assume !(10 == main_~i~0#1); 4256#L12-2 assume !(0 == main_~i~0#1); 4255#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4254#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4252#L12 assume !(10 == main_~i~0#1); 4251#L12-2 assume !(0 == main_~i~0#1); 4249#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4250#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(10 == main_~i~0#1); 4212#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4202#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 [2024-11-23 02:07:44,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 2 times [2024-11-23 02:07:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344130922] [2024-11-23 02:07:44,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:44,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:44,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:44,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:44,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:44,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1215501985, now seen corresponding path program 1 times [2024-11-23 02:07:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184662041] [2024-11-23 02:07:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-23 02:07:44,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-23 02:07:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-23 02:07:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184662041] [2024-11-23 02:07:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184662041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424255349] [2024-11-23 02:07:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:44,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:44,688 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:44,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-11-23 02:07:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:44,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 02:07:44,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-23 02:07:44,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-23 02:07:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424255349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:44,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:44,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-23 02:07:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222511207] [2024-11-23 02:07:44,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:44,802 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 02:07:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-23 02:07:44,803 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. cyclomatic complexity: 23 Second operand has 12 states, 12 states have (on average 3.5) 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) [2024-11-23 02:07:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:44,864 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2024-11-23 02:07:44,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 249 transitions. [2024-11-23 02:07:44,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2024-11-23 02:07:44,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 173 states and 213 transitions. [2024-11-23 02:07:44,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-23 02:07:44,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-23 02:07:44,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 213 transitions. [2024-11-23 02:07:44,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:44,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-11-23 02:07:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 213 transitions. [2024-11-23 02:07:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-11-23 02:07:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.225609756097561) internal successors, (201), 163 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2024-11-23 02:07:44,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-11-23 02:07:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 02:07:44,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-11-23 02:07:44,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:07:44,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 201 transitions. [2024-11-23 02:07:44,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2024-11-23 02:07:44,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:44,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:44,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-23 02:07:44,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2024-11-23 02:07:44,871 INFO L745 eck$LassoCheckResult]: Stem: 4736#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4737#L-1 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; 4731#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4733#L12 assume !(10 == main_~i~0#1); 4774#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4770#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4767#L12 [2024-11-23 02:07:44,872 INFO L747 eck$LassoCheckResult]: Loop: 4767#L12 assume !(10 == main_~i~0#1); 4765#L12-2 assume !(0 == main_~i~0#1); 4764#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4763#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4762#L12 assume !(10 == main_~i~0#1); 4761#L12-2 assume !(0 == main_~i~0#1); 4760#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4759#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4758#L12 assume !(10 == main_~i~0#1); 4757#L12-2 assume !(0 == main_~i~0#1); 4756#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4755#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4754#L12 assume !(10 == main_~i~0#1); 4753#L12-2 assume !(0 == main_~i~0#1); 4752#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4751#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4750#L12 assume !(10 == main_~i~0#1); 4747#L12-2 assume !(0 == main_~i~0#1); 4749#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4748#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4746#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4728#L12-2 assume !(0 == main_~i~0#1); 4729#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4734#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4735#L12 assume !(10 == main_~i~0#1); 4742#L12-2 assume !(0 == main_~i~0#1); 4891#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4890#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4889#L12 assume !(10 == main_~i~0#1); 4888#L12-2 assume !(0 == main_~i~0#1); 4887#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4886#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4885#L12 assume !(10 == main_~i~0#1); 4884#L12-2 assume !(0 == main_~i~0#1); 4883#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4881#L12 assume !(10 == main_~i~0#1); 4880#L12-2 assume !(0 == main_~i~0#1); 4879#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4878#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4877#L12 assume !(10 == main_~i~0#1); 4876#L12-2 assume !(0 == main_~i~0#1); 4875#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4874#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4873#L12 assume !(10 == main_~i~0#1); 4872#L12-2 assume !(0 == main_~i~0#1); 4871#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4870#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4869#L12 assume !(10 == main_~i~0#1); 4868#L12-2 assume !(0 == main_~i~0#1); 4867#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4866#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4865#L12 assume !(10 == main_~i~0#1); 4864#L12-2 assume !(0 == main_~i~0#1); 4863#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4862#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4782#L12 assume !(10 == main_~i~0#1); 4861#L12-2 assume !(0 == main_~i~0#1); 4826#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4781#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4733#L12 assume !(10 == main_~i~0#1); 4774#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4770#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4767#L12 [2024-11-23 02:07:44,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 3 times [2024-11-23 02:07:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:44,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674780962] [2024-11-23 02:07:44,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:44,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-23 02:07:44,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:44,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:44,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 726843037, now seen corresponding path program 2 times [2024-11-23 02:07:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915804516] [2024-11-23 02:07:44,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:07:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:44,887 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:07:44,887 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:44,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:44,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:44,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1110135673, now seen corresponding path program 4 times [2024-11-23 02:07:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:44,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006833705] [2024-11-23 02:07:44,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:44,916 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:44,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-23 02:07:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:45,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006833705] [2024-11-23 02:07:45,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006833705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:07:45,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253891921] [2024-11-23 02:07:45,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:45,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:07:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:45,035 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:07:45,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-11-23 02:07:45,062 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:45,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:45,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 02:07:45,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-23 02:07:45,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:07:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-23 02:07:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253891921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:07:45,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:07:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-23 02:07:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482504577] [2024-11-23 02:07:45,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:07:45,401 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:45,401 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:45,401 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:45,401 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:45,401 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-23 02:07:45,401 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:45,401 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:45,401 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:45,401 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-11-23 02:07:45,401 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:45,401 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:45,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:45,444 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-23 02:07:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:45,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:45,445 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:45,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-23 02:07:45,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-23 02:07:45,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:45,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-23 02:07:45,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:45,472 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:45,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-23 02:07:45,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-23 02:07:45,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-23 02:07:45,488 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-23 02:07:45,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-23 02:07:45,493 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:07:45,493 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:07:45,493 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:07:45,493 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:07:45,493 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:07:45,493 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:45,494 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:07:45,494 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:07:45,494 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-11-23 02:07:45,494 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:07:45,494 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:07:45,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:07:45,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:07:45,532 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:07:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:45,533 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:45,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-23 02:07:45,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:07:45,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:07:45,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:07:45,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:07:45,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:07:45,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:07:45,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:07:45,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:07:45,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:07:45,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-23 02:07:45,548 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-23 02:07:45,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:07:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:07:45,550 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:07:45,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-23 02:07:45,559 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:07:45,560 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-23 02:07:45,560 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:07:45,560 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 [] [2024-11-23 02:07:45,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:45,565 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-23 02:07:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:45,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:45,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:45,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:07:45,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 02:07:45,717 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-23 02:07:45,718 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:45,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 489 states and 580 transitions. Complement of second has 17 states. [2024-11-23 02:07:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2024-11-23 02:07:45,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-23 02:07:45,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:45,802 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:45,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:45,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:45,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:07:45,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 02:07:45,939 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-23 02:07:45,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 784 states and 937 transitions. Complement of second has 31 states. [2024-11-23 02:07:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2024-11-23 02:07:46,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-23 02:07:46,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:46,136 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:46,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:46,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:46,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:07:46,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 02:07:46,283 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-23 02:07:46,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 1329 states and 1557 transitions. Complement of second has 174 states. [2024-11-23 02:07:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2024-11-23 02:07:46,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 76 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-23 02:07:46,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:46,478 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-23 02:07:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:46,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:07:46,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:07:46,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 02:07:46,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:07:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-23 02:07:46,634 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-23 02:07:46,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-23 02:07:46,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 1639 states and 1887 transitions. Complement of second has 195 states. [2024-11-23 02:07:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2024-11-23 02:07:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2024-11-23 02:07:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-23 02:07:46,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 71 letters. Loop has 64 letters. [2024-11-23 02:07:46,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:46,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 128 letters. [2024-11-23 02:07:46,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:07:46,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1639 states and 1887 transitions. [2024-11-23 02:07:46,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-11-23 02:07:46,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1639 states to 522 states and 614 transitions. [2024-11-23 02:07:46,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-23 02:07:46,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2024-11-23 02:07:46,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 614 transitions. [2024-11-23 02:07:46,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:46,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 614 transitions. [2024-11-23 02:07:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 614 transitions. [2024-11-23 02:07:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 163. [2024-11-23 02:07:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.2085889570552146) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-11-23 02:07:46,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-11-23 02:07:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 02:07:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-23 02:07:46,863 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:46,903 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2024-11-23 02:07:46,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 454 transitions. [2024-11-23 02:07:46,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 195 [2024-11-23 02:07:46,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 298 states and 353 transitions. [2024-11-23 02:07:46,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-11-23 02:07:46,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-11-23 02:07:46,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 353 transitions. [2024-11-23 02:07:46,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:46,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 353 transitions. [2024-11-23 02:07:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 353 transitions. [2024-11-23 02:07:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 152. [2024-11-23 02:07:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 151 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2024-11-23 02:07:46,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-23 02:07:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 02:07:46,911 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-23 02:07:46,911 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:07:46,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 183 transitions. [2024-11-23 02:07:46,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2024-11-23 02:07:46,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:46,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:46,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-23 02:07:46,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 20, 19, 11, 10, 2, 1] [2024-11-23 02:07:46,913 INFO L745 eck$LassoCheckResult]: Stem: 11506#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11507#L-1 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; 11511#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11521#L12 assume !(10 == main_~i~0#1); 11524#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11522#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11515#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11517#L12 [2024-11-23 02:07:46,913 INFO L747 eck$LassoCheckResult]: Loop: 11517#L12 assume !(10 == main_~i~0#1); 11604#L12-2 assume !(0 == main_~i~0#1); 11603#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11602#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11601#L12 assume !(10 == main_~i~0#1); 11600#L12-2 assume !(0 == main_~i~0#1); 11599#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11598#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11597#L12 assume !(10 == main_~i~0#1); 11596#L12-2 assume !(0 == main_~i~0#1); 11595#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11594#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11593#L12 assume !(10 == main_~i~0#1); 11590#L12-2 assume !(0 == main_~i~0#1); 11592#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11591#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11589#L12 assume !(10 == main_~i~0#1); 11498#L12-2 assume !(0 == main_~i~0#1); 11499#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11502#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11503#L12 assume !(10 == main_~i~0#1); 11588#L12-2 assume !(0 == main_~i~0#1); 11587#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11586#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11585#L12 assume !(10 == main_~i~0#1); 11584#L12-2 assume !(0 == main_~i~0#1); 11583#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11582#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11581#L12 assume !(10 == main_~i~0#1); 11580#L12-2 assume !(0 == main_~i~0#1); 11579#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11578#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11577#L12 assume !(10 == main_~i~0#1); 11576#L12-2 assume !(0 == main_~i~0#1); 11575#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11574#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11573#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11572#L12-2 assume !(0 == main_~i~0#1); 11571#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11570#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11569#L12 assume !(10 == main_~i~0#1); 11568#L12-2 assume !(0 == main_~i~0#1); 11567#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11566#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11565#L12 assume !(10 == main_~i~0#1); 11564#L12-2 assume !(0 == main_~i~0#1); 11563#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11562#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11561#L12 assume !(10 == main_~i~0#1); 11560#L12-2 assume !(0 == main_~i~0#1); 11559#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11558#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11557#L12 assume !(10 == main_~i~0#1); 11556#L12-2 assume !(0 == main_~i~0#1); 11555#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11554#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11553#L12 assume !(10 == main_~i~0#1); 11552#L12-2 assume !(0 == main_~i~0#1); 11551#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11550#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11549#L12 assume !(10 == main_~i~0#1); 11548#L12-2 assume !(0 == main_~i~0#1); 11547#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11546#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11545#L12 assume !(10 == main_~i~0#1); 11544#L12-2 assume !(0 == main_~i~0#1); 11543#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11542#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11541#L12 assume !(10 == main_~i~0#1); 11540#L12-2 assume !(0 == main_~i~0#1); 11539#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11538#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11534#L12 assume !(10 == main_~i~0#1); 11536#L12-2 assume !(0 == main_~i~0#1); 11535#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11533#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11532#L12 assume !(10 == main_~i~0#1); 11530#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11531#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11607#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11516#L12 assume !(10 == main_~i~0#1); 11527#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11522#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11515#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11517#L12 [2024-11-23 02:07:46,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 4 times [2024-11-23 02:07:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:46,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076543605] [2024-11-23 02:07:46,913 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:46,917 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:46,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:46,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:46,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1840948782, now seen corresponding path program 3 times [2024-11-23 02:07:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304430403] [2024-11-23 02:07:46,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:07:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:46,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-23 02:07:46,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:07:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-23 02:07:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:07:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304430403] [2024-11-23 02:07:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304430403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:07:46,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:07:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:07:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704300190] [2024-11-23 02:07:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:07:46,937 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:07:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:07:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:07:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:07:46,937 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:07:46,953 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2024-11-23 02:07:46,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 181 transitions. [2024-11-23 02:07:46,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-23 02:07:46,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 144 states and 170 transitions. [2024-11-23 02:07:46,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-23 02:07:46,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-23 02:07:46,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. [2024-11-23 02:07:46,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-23 02:07:46,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-11-23 02:07:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. [2024-11-23 02:07:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2024-11-23 02:07:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 100 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 02:07:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2024-11-23 02:07:46,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-11-23 02:07:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:07:46,957 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-11-23 02:07:46,958 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-23 02:07:46,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2024-11-23 02:07:46,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-23 02:07:46,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:07:46,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:07:46,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 1, 1, 1] [2024-11-23 02:07:46,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-23 02:07:46,960 INFO L745 eck$LassoCheckResult]: Stem: 11816#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11817#L-1 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; 11820#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11829#L12 assume !(10 == main_~i~0#1); 11830#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11831#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11812#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11813#L12 assume !(10 == main_~i~0#1); 11865#L12-2 assume !(0 == main_~i~0#1); 11864#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11863#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11862#L12 assume !(10 == main_~i~0#1); 11861#L12-2 assume !(0 == main_~i~0#1); 11860#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11859#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11858#L12 assume !(10 == main_~i~0#1); 11857#L12-2 assume !(0 == main_~i~0#1); 11856#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11855#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11854#L12 assume !(10 == main_~i~0#1); 11850#L12-2 assume !(0 == main_~i~0#1); 11853#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11852#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11849#L12 assume !(10 == main_~i~0#1); 11832#L12-2 [2024-11-23 02:07:46,960 INFO L747 eck$LassoCheckResult]: Loop: 11832#L12-2 assume !(0 == main_~i~0#1); 11825#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11826#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11851#L12 assume !(10 == main_~i~0#1); 11848#L12-2 assume !(0 == main_~i~0#1); 11847#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11846#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11845#L12 assume !(10 == main_~i~0#1); 11844#L12-2 assume !(0 == main_~i~0#1); 11843#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11842#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11841#L12 assume !(10 == main_~i~0#1); 11840#L12-2 assume !(0 == main_~i~0#1); 11839#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11838#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11837#L12 assume !(10 == main_~i~0#1); 11836#L12-2 assume !(0 == main_~i~0#1); 11835#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11834#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11833#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11809#L12-2 assume !(0 == main_~i~0#1); 11810#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11814#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11815#L12 assume !(10 == main_~i~0#1); 11907#L12-2 assume !(0 == main_~i~0#1); 11906#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11905#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11904#L12 assume !(10 == main_~i~0#1); 11903#L12-2 assume !(0 == main_~i~0#1); 11902#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11901#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11900#L12 assume !(10 == main_~i~0#1); 11899#L12-2 assume !(0 == main_~i~0#1); 11898#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11897#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11896#L12 assume !(10 == main_~i~0#1); 11895#L12-2 assume !(0 == main_~i~0#1); 11894#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11893#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11892#L12 assume !(10 == main_~i~0#1); 11891#L12-2 assume !(0 == main_~i~0#1); 11890#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11889#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11888#L12 assume !(10 == main_~i~0#1); 11887#L12-2 assume !(0 == main_~i~0#1); 11886#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11885#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11884#L12 assume !(10 == main_~i~0#1); 11883#L12-2 assume !(0 == main_~i~0#1); 11882#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11881#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11880#L12 assume !(10 == main_~i~0#1); 11879#L12-2 assume !(0 == main_~i~0#1); 11878#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11877#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11874#L12 assume !(10 == main_~i~0#1); 11876#L12-2 assume !(0 == main_~i~0#1); 11875#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11873#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11872#L12 assume !(10 == main_~i~0#1); 11822#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11871#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11869#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11866#L12 assume !(10 == main_~i~0#1); 11865#L12-2 assume !(0 == main_~i~0#1); 11864#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11863#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11862#L12 assume !(10 == main_~i~0#1); 11861#L12-2 assume !(0 == main_~i~0#1); 11860#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11859#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11858#L12 assume !(10 == main_~i~0#1); 11857#L12-2 assume !(0 == main_~i~0#1); 11856#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11855#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11854#L12 assume !(10 == main_~i~0#1); 11850#L12-2 assume !(0 == main_~i~0#1); 11853#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11852#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11849#L12 assume !(10 == main_~i~0#1); 11832#L12-2 [2024-11-23 02:07:46,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 781927031, now seen corresponding path program 1 times [2024-11-23 02:07:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142135657] [2024-11-23 02:07:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:07:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:46,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:46,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:46,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 921517193, now seen corresponding path program 4 times [2024-11-23 02:07:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:46,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346171334] [2024-11-23 02:07:46,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:07:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:46,984 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:07:46,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:46,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:46,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:46,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:07:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash 933372671, now seen corresponding path program 5 times [2024-11-23 02:07:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:07:46,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248576439] [2024-11-23 02:07:46,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:07:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:07:47,009 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2024-11-23 02:07:47,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:07:47,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:47,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:07:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:47,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:07:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:07:47,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:07:47 BoogieIcfgContainer [2024-11-23 02:07:47,490 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:07:47,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:07:47,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:07:47,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:07:47,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:07:39" (3/4) ... [2024-11-23 02:07:47,493 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-23 02:07:47,535 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-23 02:07:47,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:07:47,536 INFO L158 Benchmark]: Toolchain (without parser) took 8119.34ms. Allocated memory was 136.3MB in the beginning and 224.4MB in the end (delta: 88.1MB). Free memory was 66.5MB in the beginning and 173.5MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:07:47,538 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 136.3MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:07:47,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.78ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 66.4MB in the beginning and 155.0MB in the end (delta: -88.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-23 02:07:47,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.54ms. Allocated memory is still 186.6MB. Free memory was 155.0MB in the beginning and 153.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:07:47,538 INFO L158 Benchmark]: Boogie Preprocessor took 23.59ms. Allocated memory is still 186.6MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:07:47,538 INFO L158 Benchmark]: RCFGBuilder took 271.18ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 142.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-23 02:07:47,540 INFO L158 Benchmark]: BuchiAutomizer took 7514.33ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 142.4MB in the beginning and 177.7MB in the end (delta: -35.2MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-11-23 02:07:47,540 INFO L158 Benchmark]: Witness Printer took 44.95ms. Allocated memory is still 224.4MB. Free memory was 177.7MB in the beginning and 173.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-23 02:07:47,541 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.37ms. Allocated memory is still 136.3MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.78ms. Allocated memory was 136.3MB in the beginning and 186.6MB in the end (delta: 50.3MB). Free memory was 66.4MB in the beginning and 155.0MB in the end (delta: -88.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.54ms. Allocated memory is still 186.6MB. Free memory was 155.0MB in the beginning and 153.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.59ms. Allocated memory is still 186.6MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 271.18ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 142.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7514.33ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 142.4MB in the beginning and 177.7MB in the end (delta: -35.2MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 44.95ms. Allocated memory is still 224.4MB. Free memory was 177.7MB in the beginning and 173.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 18 terminating modules (9 trivial, 5 deterministic, 4 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 5 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 (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 16 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 101 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 12 iterations. TraceHistogramMax:21. Analysis of lassos took 4.5s. Construction of modules took 0.5s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 18. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 757 StatesRemovedByMinimization, 18 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 [5, 0, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 220/480 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 863 IncrementalHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 201 mSDtfsCounter, 863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax182 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf91 smp94 dnf122 smp94 tf111 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 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=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] Loop: [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 [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) 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=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] Loop: [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 [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) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-23 02:07:47,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:47,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:47,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2024-11-23 02:07:48,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-23 02:07:48,356 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)