./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-12 00:15:07,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:15:08,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:15:08,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:15:08,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:15:08,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:15:08,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:15:08,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:15:08,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:15:08,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:15:08,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:15:08,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:15:08,063 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:15:08,063 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:15:08,063 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:15:08,064 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:15:08,064 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:15:08,064 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:15:08,064 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:15:08,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:15:08,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:15:08,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:15:08,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:15:08,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:15:08,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:15:08,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:15:08,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:15:08,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:15:08,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:15:08,067 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:15:08,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:15:08,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:15:08,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:15:08,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:15:08,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:15:08,069 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:15:08,069 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-clean/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-clean/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-10-12 00:15:08,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:15:08,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:15:08,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:15:08,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:15:08,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:15:08,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-10-12 00:15:09,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:15:09,834 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:15:09,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-10-12 00:15:09,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/adeb349e5/3f1f9f08472043edada0aafb0b42bb25/FLAG18a832de5 [2024-10-12 00:15:09,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/adeb349e5/3f1f9f08472043edada0aafb0b42bb25 [2024-10-12 00:15:09,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:15:09,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:15:09,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:15:09,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:15:09,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:15:09,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:15:09" (1/1) ... [2024-10-12 00:15:09,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5138ef75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:09, skipping insertion in model container [2024-10-12 00:15:09,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:15:09" (1/1) ... [2024-10-12 00:15:09,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:15:10,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:15:10,041 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:15:10,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:15:10,066 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:15:10,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10 WrapperNode [2024-10-12 00:15:10,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:15:10,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:15:10,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:15:10,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:15:10,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,092 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-10-12 00:15:10,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:15:10,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:15:10,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:15:10,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:15:10,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,107 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-12 00:15:10,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:15:10,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:15:10,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:15:10,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:15:10,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (1/1) ... [2024-10-12 00:15:10,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:15:10,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:15:10,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:15:10,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:15:10,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:15:10,294 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-12 00:15:10,294 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:15:10,302 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:15:10,303 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:15:10,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:15:10 BoogieIcfgContainer [2024-10-12 00:15:10,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:15:10,304 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:15:10,304 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:15:10,307 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:15:10,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:15:10,308 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:15:09" (1/3) ... [2024-10-12 00:15:10,309 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de8bbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:15:10, skipping insertion in model container [2024-10-12 00:15:10,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:15:10,309 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:15:10" (2/3) ... [2024-10-12 00:15:10,309 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de8bbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:15:10, skipping insertion in model container [2024-10-12 00:15:10,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:15:10,310 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:15:10" (3/3) ... [2024-10-12 00:15:10,311 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2024-10-12 00:15:10,354 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:15:10,354 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:15:10,354 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:15:10,354 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:15:10,355 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:15:10,355 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:15:10,355 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:15:10,355 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:15:10,358 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-10-12 00:15:10,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:15:10,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:10,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:10,374 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:15:10,374 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:10,375 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:15:10,375 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-10-12 00:15:10,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:15:10,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:10,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:10,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:15:10,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:10,382 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-10-12 00:15:10,382 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-10-12 00:15:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:15:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426815255] [2024-10-12 00:15:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:10,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:10,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:10,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-10-12 00:15:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595220425] [2024-10-12 00:15:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:10,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:10,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-10-12 00:15:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486071231] [2024-10-12 00:15:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:10,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:10,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:10,573 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:10,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:10,574 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:10,574 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:10,574 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:10,574 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,574 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:10,574 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:10,574 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-10-12 00:15:10,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:10,575 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:10,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,675 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:10,676 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:10,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:15:10,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:10,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:10,709 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:10,709 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-10-12 00:15:10,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:15:10,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:15:10,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:10,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:10,748 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:10,748 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-10-12 00:15:10,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:15:10,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:15:10,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:10,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:10,782 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:10,782 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-10-12 00:15:10,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:10,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:15:10,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:10,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:10,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:15:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:15:10,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:10,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:10,852 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:10,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:15:10,867 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:10,867 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:10,867 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:10,867 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:10,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:10,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,868 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:10,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:10,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-10-12 00:15:10,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:10,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:10,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:10,946 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:10,950 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:10,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:15:10,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:15:10,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:10,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:10,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:10,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:10,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:10,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:10,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:10,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:15:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:10,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:10,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:15:10,999 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-10-12 00:15:11,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:11,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:11,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:11,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:11,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:11,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:11,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:11,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:15:11,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:11,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:11,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:15:11,039 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-10-12 00:15:11,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:11,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:11,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:11,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:11,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:11,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:11,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:11,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:11,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:11,059 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:15:11,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:11,079 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:11,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:15:11,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:11,081 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:11,081 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:11,081 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-10-12 00:15:11,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:11,095 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:11,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:11,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:11,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:11,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:11,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:11,268 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-10-12 00:15:11,270 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-10-12 00:15:11,316 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-10-12 00:15:11,319 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-10-12 00:15:11,322 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-10-12 00:15:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-12 00:15:11,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:15:11,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:11,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-12 00:15:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:11,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-12 00:15:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:11,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-10-12 00:15:11,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:15:11,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-10-12 00:15:11,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:15:11,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:15:11,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-10-12 00:15:11,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:11,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-10-12 00:15:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-10-12 00:15:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-12 00:15:11,368 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-10-12 00:15:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-10-12 00:15:11,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-12 00:15:11,369 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-12 00:15:11,369 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:15:11,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-10-12 00:15:11,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-12 00:15:11,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:11,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:11,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:15:11,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:11,371 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-10-12 00:15:11,371 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-10-12 00:15:11,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-12 00:15:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:11,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520523771] [2024-10-12 00:15:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:11,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:11,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:11,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-10-12 00:15:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833521937] [2024-10-12 00:15:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:11,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:11,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-10-12 00:15:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700109404] [2024-10-12 00:15:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:11,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:15:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:11,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:11,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700109404] [2024-10-12 00:15:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700109404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:15:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:15:11,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:15:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173229380] [2024-10-12 00:15:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:15:11,602 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:11,602 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:11,602 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:11,602 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:11,602 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:11,602 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,602 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:11,602 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:11,602 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-10-12 00:15:11,602 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:11,602 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:11,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,785 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:11,785 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:11,787 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:11,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:11,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:11,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:15:11,817 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:11,818 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-10-12 00:15:11,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:11,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:11,833 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:11,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:15:11,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:11,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:11,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:11,863 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:11,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:15:11,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:11,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:11,931 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:11,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:11,936 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:11,936 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:11,936 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:11,936 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:11,936 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:11,936 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:11,936 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:11,936 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:11,936 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-10-12 00:15:11,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:11,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:11,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:11,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,015 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:12,015 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:15:12,021 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-10-12 00:15:12,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:12,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:12,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:12,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:12,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:12,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:12,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:12,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:15:12,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,058 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:15:12,070 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-10-12 00:15:12,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:12,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:12,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:12,084 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:15:12,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:12,088 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:15:12,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:12,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:12,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:12,097 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:15:12,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,099 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:15:12,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:12,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:12,102 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:12,102 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-10-12 00:15:12,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:12,118 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:12,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:12,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:12,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:12,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:12,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:12,239 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-10-12 00:15:12,239 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-10-12 00:15:12,268 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-10-12 00:15:12,269 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-10-12 00:15:12,270 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-10-12 00:15:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:15:12,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-12 00:15:12,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:12,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-12 00:15:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:12,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-12 00:15:12,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:12,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2024-10-12 00:15:12,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:15:12,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 35 transitions. [2024-10-12 00:15:12,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:15:12,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:15:12,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 35 transitions. [2024-10-12 00:15:12,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:12,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2024-10-12 00:15:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 35 transitions. [2024-10-12 00:15:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-12 00:15:12,276 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-10-12 00:15:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2024-10-12 00:15:12,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 34 transitions. [2024-10-12 00:15:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:15:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:15:12,280 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-10-12 00:15:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:12,292 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2024-10-12 00:15:12,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 52 transitions. [2024-10-12 00:15:12,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:15:12,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 46 transitions. [2024-10-12 00:15:12,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:15:12,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:15:12,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 46 transitions. [2024-10-12 00:15:12,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:12,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 46 transitions. [2024-10-12 00:15:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 46 transitions. [2024-10-12 00:15:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-12 00:15:12,297 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-10-12 00:15:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-10-12 00:15:12,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-10-12 00:15:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:15:12,299 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-10-12 00:15:12,299 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:15:12,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2024-10-12 00:15:12,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:15:12,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:12,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:12,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:15:12,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:12,301 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-10-12 00:15:12,301 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-10-12 00:15:12,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,301 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-10-12 00:15:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:12,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654906814] [2024-10-12 00:15:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-10-12 00:15:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892721545] [2024-10-12 00:15:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:12,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-10-12 00:15:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919618017] [2024-10-12 00:15:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:12,370 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:12,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:12,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:12,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:12,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:12,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:12,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:12,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-10-12 00:15:12,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:12,371 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:12,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,444 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:12,444 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:12,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,446 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:15:12,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:12,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:12,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:15:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,486 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:15:12,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:12,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:12,585 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:12,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:12,591 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:12,591 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:12,592 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:12,592 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:12,592 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:12,592 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:12,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:12,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-10-12 00:15:12,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:12,592 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:12,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,664 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:12,664 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,669 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:15:12,675 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-10-12 00:15:12,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:12,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:12,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:12,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:12,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:12,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:12,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:12,692 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:12,695 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:12,695 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:15:12,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,703 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:15:12,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:12,709 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:12,709 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:12,710 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-10-12 00:15:12,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:15:12,726 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:12,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:12,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:12,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:12,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:12,787 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-10-12 00:15:12,788 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-10-12 00:15:12,819 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-10-12 00:15:12,823 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-10-12 00:15:12,824 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-10-12 00:15:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-12 00:15:12,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-12 00:15:12,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:12,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:15:12,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:12,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-12 00:15:12,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:12,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 104 transitions. [2024-10-12 00:15:12,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:15:12,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 98 transitions. [2024-10-12 00:15:12,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-12 00:15:12,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-12 00:15:12,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 98 transitions. [2024-10-12 00:15:12,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:12,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 98 transitions. [2024-10-12 00:15:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 98 transitions. [2024-10-12 00:15:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-10-12 00:15:12,837 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-10-12 00:15:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 94 transitions. [2024-10-12 00:15:12,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-10-12 00:15:12,839 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-10-12 00:15:12,839 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:15:12,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 94 transitions. [2024-10-12 00:15:12,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-12 00:15:12,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:12,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:12,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:15:12,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:12,844 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-10-12 00:15:12,844 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-10-12 00:15:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-10-12 00:15:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415990070] [2024-10-12 00:15:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:12,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415990070] [2024-10-12 00:15:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415990070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:15:12,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:15:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:15:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526833894] [2024-10-12 00:15:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:15:12,872 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:15:12,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 2 times [2024-10-12 00:15:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:12,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286682894] [2024-10-12 00:15:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:12,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:12,901 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:12,901 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:12,901 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:12,901 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:12,901 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:12,901 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,902 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:12,902 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:12,902 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-10-12 00:15:12,902 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:12,902 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:12,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:12,955 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:12,956 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:12,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:12,958 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:12,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:15:12,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:12,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:12,984 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:12,984 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-10-12 00:15:12,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:15:12,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,002 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:15:13,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:13,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:13,021 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:13,021 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-10-12 00:15:13,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:15:13,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,043 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:15:13,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:13,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:13,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,078 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:15:13,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:13,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:13,098 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:13,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:15:13,115 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:13,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:13,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:13,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:13,116 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:13,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:13,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:13,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-10-12 00:15:13,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:13,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:13,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:13,171 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,173 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:15:13,179 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-10-12 00:15:13,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:13,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:13,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:13,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:13,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:13,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:13,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:13,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:13,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,217 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:15:13,219 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-10-12 00:15:13,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:13,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:13,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:13,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:13,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:13,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:13,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:13,236 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:13,239 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:13,239 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:15:13,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,241 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:15:13,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:13,244 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:13,247 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:13,247 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-10-12 00:15:13,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:13,269 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:13,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:13,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:13,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:13,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:13,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:13,394 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-10-12 00:15:13,394 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-10-12 00:15:13,431 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-10-12 00:15:13,442 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-10-12 00:15:13,443 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-10-12 00:15:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-12 00:15:13,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-12 00:15:13,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:13,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-12 00:15:13,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:13,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 8 letters. [2024-10-12 00:15:13,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:13,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 190 transitions. [2024-10-12 00:15:13,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-12 00:15:13,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 107 states and 175 transitions. [2024-10-12 00:15:13,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-12 00:15:13,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-12 00:15:13,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 175 transitions. [2024-10-12 00:15:13,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:13,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 175 transitions. [2024-10-12 00:15:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 175 transitions. [2024-10-12 00:15:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2024-10-12 00:15:13,466 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-10-12 00:15:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2024-10-12 00:15:13,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 161 transitions. [2024-10-12 00:15:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:15:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:15:13,467 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-10-12 00:15:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:13,481 INFO L93 Difference]: Finished difference Result 107 states and 163 transitions. [2024-10-12 00:15:13,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 163 transitions. [2024-10-12 00:15:13,482 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2024-10-12 00:15:13,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 153 transitions. [2024-10-12 00:15:13,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-12 00:15:13,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-12 00:15:13,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 153 transitions. [2024-10-12 00:15:13,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:13,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-10-12 00:15:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 153 transitions. [2024-10-12 00:15:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-10-12 00:15:13,511 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-10-12 00:15:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-10-12 00:15:13,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-10-12 00:15:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:15:13,516 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-10-12 00:15:13,517 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:15:13,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 148 transitions. [2024-10-12 00:15:13,518 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-12 00:15:13,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:13,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:13,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2024-10-12 00:15:13,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:13,518 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-10-12 00:15:13,518 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-10-12 00:15:13,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1506873443, now seen corresponding path program 1 times [2024-10-12 00:15:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862824238] [2024-10-12 00:15:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:13,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:13,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:15:13,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:15:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:13,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:13,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862824238] [2024-10-12 00:15:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862824238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:15:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:15:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:15:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150293313] [2024-10-12 00:15:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:15:13,593 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:15:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 3 times [2024-10-12 00:15:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491111661] [2024-10-12 00:15:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:13,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:13,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:13,632 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:13,633 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:13,633 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:13,633 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:13,633 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:13,633 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,633 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:13,633 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:13,633 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-10-12 00:15:13,633 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:13,633 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:13,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,696 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:13,696 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:13,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,698 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:15:13,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:13,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:13,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:15:13,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,736 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:15:13,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:13,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:13,762 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:13,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:13,777 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:13,778 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:13,778 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:13,778 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:13,778 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:13,778 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,778 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:13,778 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:13,778 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-10-12 00:15:13,778 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:13,778 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:13,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:13,838 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:13,838 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:13,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,842 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:15:13,849 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-10-12 00:15:13,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:13,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:13,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:13,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:13,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:13,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:13,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:13,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:15:13,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,890 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:15:13,903 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-10-12 00:15:13,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:13,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:13,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:13,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:13,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:13,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:13,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:13,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:13,922 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:13,922 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:15:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:13,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:13,924 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:13,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:15:13,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:13,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:13,927 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:13,927 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-10-12 00:15:13,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:13,943 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:13,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:13,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:13,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:14,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:14,039 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-10-12 00:15:14,040 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-10-12 00:15:14,100 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-10-12 00:15:14,107 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-10-12 00:15:14,108 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-10-12 00:15:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-12 00:15:14,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-12 00:15:14,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:14,109 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:14,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:14,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:14,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:14,209 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-10-12 00:15:14,209 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-10-12 00:15:14,259 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-10-12 00:15:14,263 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-10-12 00:15:14,264 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-10-12 00:15:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-12 00:15:14,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-12 00:15:14,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:14,265 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:14,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:14,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:14,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:14,385 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-10-12 00:15:14,390 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-10-12 00:15:14,443 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-10-12 00:15:14,449 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-10-12 00:15:14,450 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-10-12 00:15:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-12 00:15:14,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-12 00:15:14,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:14,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-12 00:15:14,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:14,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-12 00:15:14,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:14,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 250 transitions. [2024-10-12 00:15:14,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2024-10-12 00:15:14,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 119 states and 180 transitions. [2024-10-12 00:15:14,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-12 00:15:14,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-12 00:15:14,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 180 transitions. [2024-10-12 00:15:14,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:14,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-10-12 00:15:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 180 transitions. [2024-10-12 00:15:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2024-10-12 00:15:14,489 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-10-12 00:15:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-10-12 00:15:14,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-10-12 00:15:14,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:15:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:15:14,499 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-10-12 00:15:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:14,518 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-10-12 00:15:14,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2024-10-12 00:15:14,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-12 00:15:14,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 68 transitions. [2024-10-12 00:15:14,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-12 00:15:14,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:15:14,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 68 transitions. [2024-10-12 00:15:14,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:14,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-10-12 00:15:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 68 transitions. [2024-10-12 00:15:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-10-12 00:15:14,530 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-10-12 00:15:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-12 00:15:14,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-12 00:15:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:15:14,537 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-12 00:15:14,538 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:15:14,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2024-10-12 00:15:14,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:15:14,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:14,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:14,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:15:14,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:14,543 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-10-12 00:15:14,543 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-10-12 00:15:14,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1179049836, now seen corresponding path program 1 times [2024-10-12 00:15:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:14,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548808161] [2024-10-12 00:15:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548808161] [2024-10-12 00:15:14,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548808161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:15:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685954869] [2024-10-12 00:15:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:15:14,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:14,639 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:15:14,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-12 00:15:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:14,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:15:14,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:14,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:15:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685954869] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:15:14,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:15:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-12 00:15:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779954155] [2024-10-12 00:15:14,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:15:14,761 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:15:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 2 times [2024-10-12 00:15:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:14,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037586388] [2024-10-12 00:15:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:14,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:14,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:14,837 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:14,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:14,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:14,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:14,841 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:14,841 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:14,841 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:14,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:14,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-10-12 00:15:14,842 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:14,842 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:14,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:14,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:14,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:14,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:14,955 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:14,955 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:14,960 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:14,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:15:14,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:14,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:15,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:15,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:15,037 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:15,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:15,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:15,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:15:15,222 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:15,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:15,233 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:15,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:15,233 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:15,233 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:15,233 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:15,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:15,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:15,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:15,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-10-12 00:15:15,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:15,234 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:15,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:15,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:15,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:15,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:15,370 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:15,370 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:15,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:15,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:15,380 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:15,386 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-10-12 00:15:15,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:15:15,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:15,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:15,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:15,411 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:15:15,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:15,413 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:15:15,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:15,419 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:15,423 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:15,426 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:15:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:15,428 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:15,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:15:15,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:15,430 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:15,430 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:15,430 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-10-12 00:15:15,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:15,445 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:15,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:15,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:15,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:15,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:15,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:15,538 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-10-12 00:15:15,539 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-10-12 00:15:15,583 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-10-12 00:15:15,585 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-10-12 00:15:15,586 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-10-12 00:15:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:15:15,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-12 00:15:15,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:15,586 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:15,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:15,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:15,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:15,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:15,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:15,674 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-10-12 00:15:15,674 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-10-12 00:15:15,719 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-10-12 00:15:15,721 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-10-12 00:15:15,722 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-10-12 00:15:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:15:15,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-12 00:15:15,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:15,722 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:15,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:15,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:15,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:15,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:15,814 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-10-12 00:15:15,814 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-10-12 00:15:15,853 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-10-12 00:15:15,857 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-10-12 00:15:15,857 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-10-12 00:15:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-12 00:15:15,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-12 00:15:15,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:15,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-12 00:15:15,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:15,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 8 letters. [2024-10-12 00:15:15,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:15,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 124 transitions. [2024-10-12 00:15:15,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-12 00:15:15,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 56 states and 76 transitions. [2024-10-12 00:15:15,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:15:15,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:15:15,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2024-10-12 00:15:15,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:15,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-12 00:15:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2024-10-12 00:15:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-10-12 00:15:15,863 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-10-12 00:15:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-10-12 00:15:15,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-10-12 00:15:15,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:15:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:15:15,864 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-10-12 00:15:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:15,947 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-10-12 00:15:15,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2024-10-12 00:15:15,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-10-12 00:15:15,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 72 states and 93 transitions. [2024-10-12 00:15:15,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-12 00:15:15,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-12 00:15:15,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2024-10-12 00:15:15,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:15,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-10-12 00:15:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2024-10-12 00:15:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-10-12 00:15:15,952 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-10-12 00:15:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-12 00:15:15,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-12 00:15:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:15:15,959 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-12 00:15:15,959 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:15:15,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 85 transitions. [2024-10-12 00:15:15,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-12 00:15:15,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:15,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:15,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:15:15,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:15,961 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-10-12 00:15:15,961 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-10-12 00:15:15,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 2 times [2024-10-12 00:15:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686772333] [2024-10-12 00:15:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 00:15:16,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:16,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686772333] [2024-10-12 00:15:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686772333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:15:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:15:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:15:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617238749] [2024-10-12 00:15:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:15:16,004 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:15:16,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:16,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-10-12 00:15:16,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:16,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315833617] [2024-10-12 00:15:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:16,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:16,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:16,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:16,075 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:16,075 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:16,075 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:16,075 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:16,076 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:16,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:16,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:16,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-10-12 00:15:16,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:16,076 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:16,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:16,174 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,178 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:15:16,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:16,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:16,207 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:16,208 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-10-12 00:15:16,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,225 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:15:16,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:16,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:16,252 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:16,252 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-10-12 00:15:16,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,272 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:15:16,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:16,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:16,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-12 00:15:16,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,306 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:15:16,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:16,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:16,327 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:16,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:15:16,343 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:16,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:16,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:16,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:16,343 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:16,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:16,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:16,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-10-12 00:15:16,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:16,344 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:16,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:16,417 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:16,417 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,422 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:15:16,425 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-10-12 00:15:16,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:16,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:16,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:16,442 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:15:16,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:16,444 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:15:16,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:16,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:16,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,469 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:15:16,473 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-10-12 00:15:16,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:16,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:16,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:16,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:16,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:16,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:16,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:16,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,507 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:15:16,510 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-10-12 00:15:16,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:16,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:16,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:16,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:16,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:16,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:16,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:16,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,549 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:15:16,557 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-10-12 00:15:16,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:16,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:16,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:16,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:16,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:16,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:16,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:16,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:16,575 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:16,575 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:15:16,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:16,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,581 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:15:16,583 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:16,583 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:16,583 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:16,583 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-10-12 00:15:16,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,599 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:16,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:16,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:16,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:16,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:15:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:16,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:16,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:16,702 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-10-12 00:15:16,702 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-10-12 00:15:16,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-12 00:15:16,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:16,821 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-10-12 00:15:16,822 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-10-12 00:15:16,823 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-10-12 00:15:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-12 00:15:16,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:15:16,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:16,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-10-12 00:15:16,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:16,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-10-12 00:15:16,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:16,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 209 transitions. [2024-10-12 00:15:16,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-12 00:15:16,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 126 states and 161 transitions. [2024-10-12 00:15:16,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:15:16,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:15:16,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 161 transitions. [2024-10-12 00:15:16,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:16,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-10-12 00:15:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 161 transitions. [2024-10-12 00:15:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-10-12 00:15:16,845 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-10-12 00:15:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2024-10-12 00:15:16,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2024-10-12 00:15:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:15:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:15:16,847 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-10-12 00:15:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:16,865 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2024-10-12 00:15:16,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 174 transitions. [2024-10-12 00:15:16,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-10-12 00:15:16,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 174 transitions. [2024-10-12 00:15:16,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:15:16,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:15:16,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 174 transitions. [2024-10-12 00:15:16,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:16,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 174 transitions. [2024-10-12 00:15:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 174 transitions. [2024-10-12 00:15:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-10-12 00:15:16,870 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-10-12 00:15:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2024-10-12 00:15:16,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-10-12 00:15:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:15:16,872 INFO L425 stractBuchiCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-10-12 00:15:16,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:15:16,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 147 transitions. [2024-10-12 00:15:16,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-12 00:15:16,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:16,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:16,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2024-10-12 00:15:16,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:15:16,874 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-10-12 00:15:16,874 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-10-12 00:15:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 3 times [2024-10-12 00:15:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495136573] [2024-10-12 00:15:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 00:15:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:16,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495136573] [2024-10-12 00:15:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495136573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:15:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551492856] [2024-10-12 00:15:16,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:15:16,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:15:16,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:16,971 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:15:16,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-10-12 00:15:17,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 00:15:17,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:15:17,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:15:17,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:15:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 00:15:17,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551492856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:15:17,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:15:17,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2024-10-12 00:15:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449624245] [2024-10-12 00:15:17,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:15:17,071 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:15:17,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-10-12 00:15:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418672435] [2024-10-12 00:15:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:17,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:17,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:17,103 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:17,104 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:17,104 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:17,104 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:17,104 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:17,104 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,104 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:17,104 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:17,104 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-10-12 00:15:17,104 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:17,104 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:17,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,163 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:17,163 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:17,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:17,166 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:17,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:15:17,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:17,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:17,196 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:17,197 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-10-12 00:15:17,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-12 00:15:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:17,218 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:17,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:15:17,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:17,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:17,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:17,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:17,252 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:17,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:15:17,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:17,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:17,270 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:17,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:17,286 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:17,286 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:17,286 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:17,286 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:17,286 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:17,286 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,286 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:17,286 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:17,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-10-12 00:15:17,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:17,286 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:17,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:17,380 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:17,381 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:17,387 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:17,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:15:17,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:15:17,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:17,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:17,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:17,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:17,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:17,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:17,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:17,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:17,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:17,430 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:15:17,436 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-10-12 00:15:17,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:17,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:17,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:17,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:17,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:17,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:17,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:17,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:17,459 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:17,460 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:15:17,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:17,462 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:17,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:15:17,467 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:17,467 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:17,467 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:17,467 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-10-12 00:15:17,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:15:17,484 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:17,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:17,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:17,623 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-10-12 00:15:17,623 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-10-12 00:15:17,655 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-10-12 00:15:17,656 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-10-12 00:15:17,656 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-10-12 00:15:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-12 00:15:17,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-12 00:15:17,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:17,657 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:17,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:17,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:17,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:17,788 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-10-12 00:15:17,788 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-10-12 00:15:17,832 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-10-12 00:15:17,833 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-10-12 00:15:17,833 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-10-12 00:15:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-10-12 00:15:17,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-12 00:15:17,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:17,834 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:17,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:17,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:15:17,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:15:17,990 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-10-12 00:15:17,991 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-10-12 00:15:18,037 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-10-12 00:15:18,040 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-10-12 00:15:18,041 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-10-12 00:15:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-12 00:15:18,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-12 00:15:18,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:18,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2024-10-12 00:15:18,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:18,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2024-10-12 00:15:18,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:18,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 219 transitions. [2024-10-12 00:15:18,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-12 00:15:18,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 121 states and 151 transitions. [2024-10-12 00:15:18,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:15:18,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:15:18,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 151 transitions. [2024-10-12 00:15:18,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:18,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 151 transitions. [2024-10-12 00:15:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 151 transitions. [2024-10-12 00:15:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2024-10-12 00:15:18,048 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-10-12 00:15:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-10-12 00:15:18,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-10-12 00:15:18,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:15:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:15:18,050 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:15:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:18,221 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2024-10-12 00:15:18,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 194 transitions. [2024-10-12 00:15:18,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2024-10-12 00:15:18,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 153 states and 188 transitions. [2024-10-12 00:15:18,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:15:18,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:15:18,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 188 transitions. [2024-10-12 00:15:18,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:18,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 188 transitions. [2024-10-12 00:15:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 188 transitions. [2024-10-12 00:15:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 104. [2024-10-12 00:15:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 103 states have internal predecessors, (126), 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-10-12 00:15:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-10-12 00:15:18,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-12 00:15:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:15:18,229 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-12 00:15:18,229 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:15:18,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 126 transitions. [2024-10-12 00:15:18,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-10-12 00:15:18,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:18,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:18,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-12 00:15:18,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 6, 5, 1, 1] [2024-10-12 00:15:18,232 INFO L745 eck$LassoCheckResult]: Stem: 4223#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4224#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; 4218#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4220#L12 assume !(10 == main_~i~0#1); 4243#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4241#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4233#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4234#L12 [2024-10-12 00:15:18,232 INFO L747 eck$LassoCheckResult]: Loop: 4234#L12 assume !(10 == main_~i~0#1); 4262#L12-2 assume !(0 == main_~i~0#1); 4261#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4260#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4259#L12 assume !(10 == main_~i~0#1); 4258#L12-2 assume !(0 == main_~i~0#1); 4257#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4256#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4255#L12 assume !(10 == main_~i~0#1); 4254#L12-2 assume !(0 == main_~i~0#1); 4253#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4252#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4251#L12 assume !(10 == main_~i~0#1); 4250#L12-2 assume !(0 == main_~i~0#1); 4249#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4248#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4247#L12 assume !(10 == main_~i~0#1); 4237#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); 4236#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4238#L12-2 assume !(0 == main_~i~0#1); 4302#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4301#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4300#L12 assume !(10 == main_~i~0#1); 4299#L12-2 assume !(0 == main_~i~0#1); 4298#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4297#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4296#L12 assume !(10 == main_~i~0#1); 4295#L12-2 assume !(0 == main_~i~0#1); 4294#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4293#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4292#L12 assume !(10 == main_~i~0#1); 4291#L12-2 assume !(0 == main_~i~0#1); 4290#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4289#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4287#L12 assume !(10 == main_~i~0#1); 4286#L12-2 assume !(0 == main_~i~0#1); 4284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4285#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4220#L12 assume !(10 == main_~i~0#1); 4243#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4241#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4233#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4234#L12 [2024-10-12 00:15:18,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 2 times [2024-10-12 00:15:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737845848] [2024-10-12 00:15:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:18,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:18,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1466490324, now seen corresponding path program 1 times [2024-10-12 00:15:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763939626] [2024-10-12 00:15:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 00:15:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763939626] [2024-10-12 00:15:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763939626] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:15:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589665579] [2024-10-12 00:15:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:18,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:15:18,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:18,392 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:15:18,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-10-12 00:15:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:18,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:15:18,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 00:15:18,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:15:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 00:15:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589665579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:15:18,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:15:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-12 00:15:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661387003] [2024-10-12 00:15:18,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:15:18,617 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:15:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:15:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:15:18,618 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. cyclomatic complexity: 26 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:15:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:18,734 INFO L93 Difference]: Finished difference Result 198 states and 243 transitions. [2024-10-12 00:15:18,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 243 transitions. [2024-10-12 00:15:18,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2024-10-12 00:15:18,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 173 states and 213 transitions. [2024-10-12 00:15:18,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:15:18,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:15:18,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 213 transitions. [2024-10-12 00:15:18,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:18,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-10-12 00:15:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 213 transitions. [2024-10-12 00:15:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-10-12 00:15:18,740 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-10-12 00:15:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2024-10-12 00:15:18,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-10-12 00:15:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:15:18,745 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-10-12 00:15:18,745 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:15:18,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 201 transitions. [2024-10-12 00:15:18,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2024-10-12 00:15:18,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:18,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:18,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-12 00:15:18,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2024-10-12 00:15:18,748 INFO L745 eck$LassoCheckResult]: Stem: 4798#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4799#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; 4793#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4795#L12 assume !(10 == main_~i~0#1); 4837#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4807#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4808#L12 [2024-10-12 00:15:18,748 INFO L747 eck$LassoCheckResult]: Loop: 4808#L12 assume !(10 == main_~i~0#1); 4829#L12-2 assume !(0 == main_~i~0#1); 4828#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4827#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4826#L12 assume !(10 == main_~i~0#1); 4825#L12-2 assume !(0 == main_~i~0#1); 4824#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4823#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4822#L12 assume !(10 == main_~i~0#1); 4821#L12-2 assume !(0 == main_~i~0#1); 4820#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4819#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4818#L12 assume !(10 == main_~i~0#1); 4817#L12-2 assume !(0 == main_~i~0#1); 4816#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4815#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4814#L12 assume !(10 == main_~i~0#1); 4811#L12-2 assume !(0 == main_~i~0#1); 4813#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4812#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4810#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4790#L12-2 assume !(0 == main_~i~0#1); 4791#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4796#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4797#L12 assume !(10 == main_~i~0#1); 4804#L12-2 assume !(0 == main_~i~0#1); 4953#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4952#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4951#L12 assume !(10 == main_~i~0#1); 4950#L12-2 assume !(0 == main_~i~0#1); 4949#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4948#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4947#L12 assume !(10 == main_~i~0#1); 4946#L12-2 assume !(0 == main_~i~0#1); 4945#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4944#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4943#L12 assume !(10 == main_~i~0#1); 4942#L12-2 assume !(0 == main_~i~0#1); 4941#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4940#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4939#L12 assume !(10 == main_~i~0#1); 4938#L12-2 assume !(0 == main_~i~0#1); 4937#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4936#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4935#L12 assume !(10 == main_~i~0#1); 4934#L12-2 assume !(0 == main_~i~0#1); 4933#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4932#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4931#L12 assume !(10 == main_~i~0#1); 4930#L12-2 assume !(0 == main_~i~0#1); 4929#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4928#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4927#L12 assume !(10 == main_~i~0#1); 4926#L12-2 assume !(0 == main_~i~0#1); 4925#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4924#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4844#L12 assume !(10 == main_~i~0#1); 4923#L12-2 assume !(0 == main_~i~0#1); 4888#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4843#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4795#L12 assume !(10 == main_~i~0#1); 4837#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4807#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4808#L12 [2024-10-12 00:15:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 3 times [2024-10-12 00:15:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734998272] [2024-10-12 00:15:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:18,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:18,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:18,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash 726843037, now seen corresponding path program 2 times [2024-10-12 00:15:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657919756] [2024-10-12 00:15:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:18,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:18,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:18,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1110135673, now seen corresponding path program 4 times [2024-10-12 00:15:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:18,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782255593] [2024-10-12 00:15:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:18,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-12 00:15:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-12 00:15:18,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782255593] [2024-10-12 00:15:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782255593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:15:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647252271] [2024-10-12 00:15:18,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:15:18,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:15:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:18,997 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:15:18,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-10-12 00:15:19,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:15:19,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:15:19,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:15:19,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-12 00:15:19,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:15:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-12 00:15:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647252271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:15:19,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:15:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-10-12 00:15:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906766292] [2024-10-12 00:15:19,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:15:19,480 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:19,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:19,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:19,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:19,481 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:15:19,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:19,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:19,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-10-12 00:15:19,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:19,481 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:19,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,532 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:19,532 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:15:19,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:19,537 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:19,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:15:19,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:19,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:19,562 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:15:19,562 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:15:19,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 00:15:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:19,582 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:19,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:15:19,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:19,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:15:19,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:19,625 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:19,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:15:19,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:15:19,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:15:19,642 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:15:19,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:19,657 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:15:19,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:15:19,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:15:19,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:15:19,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:15:19,658 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,658 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:15:19,658 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:15:19,658 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-10-12 00:15:19,658 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:15:19,658 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:15:19,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:15:19,709 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:15:19,709 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:15:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:19,712 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:19,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:15:19,713 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-10-12 00:15:19,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:19,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:19,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:19,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:19,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:15:19,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:15:19,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:15:19,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:15:19,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:19,746 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:19,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:15:19,748 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-10-12 00:15:19,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:15:19,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:15:19,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:15:19,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:15:19,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:15:19,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:15:19,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:15:19,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:15:19,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:15:19,767 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:15:19,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:15:19,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:15:19,770 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:15:19,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:15:19,771 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:15:19,771 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:15:19,771 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:15:19,771 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-10-12 00:15:19,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:15:19,792 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:15:19,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:19,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:19,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:19,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:15:19,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 00:15:19,991 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-10-12 00:15:19,991 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-10-12 00:15:20,102 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-10-12 00:15:20,103 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-10-12 00:15:20,103 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-10-12 00:15:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2024-10-12 00:15:20,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-12 00:15:20,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:20,104 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:20,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:20,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:20,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:20,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:15:20,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 00:15:20,293 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-10-12 00:15:20,293 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-10-12 00:15:20,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:15:20,566 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-10-12 00:15:20,567 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-10-12 00:15:20,567 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-10-12 00:15:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2024-10-12 00:15:20,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-12 00:15:20,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:20,568 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:20,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:20,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:20,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:20,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:15:20,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 00:15:20,749 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-10-12 00:15:20,750 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-10-12 00:15:20,987 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-10-12 00:15:20,988 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-10-12 00:15:20,988 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-10-12 00:15:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2024-10-12 00:15:20,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 76 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-12 00:15:20,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:20,991 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:15:21,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:21,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:15:21,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:21,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:15:21,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:15:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 00:15:21,176 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-10-12 00:15:21,177 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-10-12 00:15:21,427 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-10-12 00:15:21,427 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-10-12 00:15:21,428 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-10-12 00:15:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2024-10-12 00:15:21,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-12 00:15:21,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:21,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 71 letters. Loop has 64 letters. [2024-10-12 00:15:21,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:21,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 128 letters. [2024-10-12 00:15:21,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:15:21,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1639 states and 1887 transitions. [2024-10-12 00:15:21,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-10-12 00:15:21,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1639 states to 522 states and 614 transitions. [2024-10-12 00:15:21,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-12 00:15:21,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2024-10-12 00:15:21,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 614 transitions. [2024-10-12 00:15:21,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:21,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 614 transitions. [2024-10-12 00:15:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 614 transitions. [2024-10-12 00:15:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 163. [2024-10-12 00:15:21,449 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-10-12 00:15:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-10-12 00:15:21,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-10-12 00:15:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 00:15:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-12 00:15:21,450 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-10-12 00:15:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:21,503 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2024-10-12 00:15:21,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 454 transitions. [2024-10-12 00:15:21,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 195 [2024-10-12 00:15:21,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 298 states and 353 transitions. [2024-10-12 00:15:21,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-10-12 00:15:21,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-10-12 00:15:21,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 353 transitions. [2024-10-12 00:15:21,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:21,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 353 transitions. [2024-10-12 00:15:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 353 transitions. [2024-10-12 00:15:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 152. [2024-10-12 00:15:21,510 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-10-12 00:15:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2024-10-12 00:15:21,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-10-12 00:15:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:15:21,511 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-10-12 00:15:21,511 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:15:21,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 183 transitions. [2024-10-12 00:15:21,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2024-10-12 00:15:21,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:21,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:21,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-12 00:15:21,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 20, 19, 11, 10, 2, 1] [2024-10-12 00:15:21,513 INFO L745 eck$LassoCheckResult]: Stem: 11568#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11569#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; 11573#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11583#L12 assume !(10 == main_~i~0#1); 11586#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11577#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11578#L12 [2024-10-12 00:15:21,514 INFO L747 eck$LassoCheckResult]: Loop: 11578#L12 assume !(10 == main_~i~0#1); 11666#L12-2 assume !(0 == main_~i~0#1); 11665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11664#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11663#L12 assume !(10 == main_~i~0#1); 11662#L12-2 assume !(0 == main_~i~0#1); 11661#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11660#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11659#L12 assume !(10 == main_~i~0#1); 11658#L12-2 assume !(0 == main_~i~0#1); 11657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11656#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11655#L12 assume !(10 == main_~i~0#1); 11652#L12-2 assume !(0 == main_~i~0#1); 11654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11653#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11651#L12 assume !(10 == main_~i~0#1); 11560#L12-2 assume !(0 == main_~i~0#1); 11561#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11564#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11565#L12 assume !(10 == main_~i~0#1); 11650#L12-2 assume !(0 == main_~i~0#1); 11649#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11648#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11647#L12 assume !(10 == main_~i~0#1); 11646#L12-2 assume !(0 == main_~i~0#1); 11645#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11644#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11643#L12 assume !(10 == main_~i~0#1); 11642#L12-2 assume !(0 == main_~i~0#1); 11641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11640#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11639#L12 assume !(10 == main_~i~0#1); 11638#L12-2 assume !(0 == main_~i~0#1); 11637#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11636#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11635#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11634#L12-2 assume !(0 == main_~i~0#1); 11633#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11632#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11631#L12 assume !(10 == main_~i~0#1); 11630#L12-2 assume !(0 == main_~i~0#1); 11629#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11628#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11627#L12 assume !(10 == main_~i~0#1); 11626#L12-2 assume !(0 == main_~i~0#1); 11625#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11624#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11623#L12 assume !(10 == main_~i~0#1); 11622#L12-2 assume !(0 == main_~i~0#1); 11621#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11620#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11619#L12 assume !(10 == main_~i~0#1); 11618#L12-2 assume !(0 == main_~i~0#1); 11617#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11616#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11615#L12 assume !(10 == main_~i~0#1); 11614#L12-2 assume !(0 == main_~i~0#1); 11613#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11612#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11611#L12 assume !(10 == main_~i~0#1); 11610#L12-2 assume !(0 == main_~i~0#1); 11609#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11608#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11607#L12 assume !(10 == main_~i~0#1); 11606#L12-2 assume !(0 == main_~i~0#1); 11605#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11604#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11603#L12 assume !(10 == main_~i~0#1); 11602#L12-2 assume !(0 == main_~i~0#1); 11601#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11600#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11596#L12 assume !(10 == main_~i~0#1); 11598#L12-2 assume !(0 == main_~i~0#1); 11597#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11595#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11594#L12 assume !(10 == main_~i~0#1); 11592#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11593#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11668#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11579#L12 assume !(10 == main_~i~0#1); 11589#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11577#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11578#L12 [2024-10-12 00:15:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 4 times [2024-10-12 00:15:21,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:21,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178644216] [2024-10-12 00:15:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:21,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1840948782, now seen corresponding path program 3 times [2024-10-12 00:15:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:21,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827769732] [2024-10-12 00:15:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:15:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-12 00:15:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:15:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827769732] [2024-10-12 00:15:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827769732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:15:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:15:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:15:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614855020] [2024-10-12 00:15:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:15:21,569 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:15:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:15:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:15:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:15:21,570 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.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:15:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:15:21,585 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2024-10-12 00:15:21,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 181 transitions. [2024-10-12 00:15:21,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-10-12 00:15:21,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 144 states and 170 transitions. [2024-10-12 00:15:21,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-12 00:15:21,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-12 00:15:21,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. [2024-10-12 00:15:21,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:15:21,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-10-12 00:15:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. [2024-10-12 00:15:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2024-10-12 00:15:21,590 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-10-12 00:15:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2024-10-12 00:15:21,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-10-12 00:15:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:15:21,591 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-10-12 00:15:21,591 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:15:21,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2024-10-12 00:15:21,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-10-12 00:15:21,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:15:21,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:15:21,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 1, 1, 1] [2024-10-12 00:15:21,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-10-12 00:15:21,593 INFO L745 eck$LassoCheckResult]: Stem: 11878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11879#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; 11882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11891#L12 assume !(10 == main_~i~0#1); 11892#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11893#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11874#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11875#L12 assume !(10 == main_~i~0#1); 11927#L12-2 assume !(0 == main_~i~0#1); 11926#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11925#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11924#L12 assume !(10 == main_~i~0#1); 11923#L12-2 assume !(0 == main_~i~0#1); 11922#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11921#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11920#L12 assume !(10 == main_~i~0#1); 11919#L12-2 assume !(0 == main_~i~0#1); 11918#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11917#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11916#L12 assume !(10 == main_~i~0#1); 11912#L12-2 assume !(0 == main_~i~0#1); 11915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11914#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11911#L12 assume !(10 == main_~i~0#1); 11894#L12-2 [2024-10-12 00:15:21,594 INFO L747 eck$LassoCheckResult]: Loop: 11894#L12-2 assume !(0 == main_~i~0#1); 11887#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11888#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11913#L12 assume !(10 == main_~i~0#1); 11910#L12-2 assume !(0 == main_~i~0#1); 11909#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11908#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11907#L12 assume !(10 == main_~i~0#1); 11906#L12-2 assume !(0 == main_~i~0#1); 11905#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11904#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11903#L12 assume !(10 == main_~i~0#1); 11902#L12-2 assume !(0 == main_~i~0#1); 11901#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11900#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11899#L12 assume !(10 == main_~i~0#1); 11898#L12-2 assume !(0 == main_~i~0#1); 11897#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11896#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11895#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11871#L12-2 assume !(0 == main_~i~0#1); 11872#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11876#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11877#L12 assume !(10 == main_~i~0#1); 11969#L12-2 assume !(0 == main_~i~0#1); 11968#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11967#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11966#L12 assume !(10 == main_~i~0#1); 11965#L12-2 assume !(0 == main_~i~0#1); 11964#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11963#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11962#L12 assume !(10 == main_~i~0#1); 11961#L12-2 assume !(0 == main_~i~0#1); 11960#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11959#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11958#L12 assume !(10 == main_~i~0#1); 11957#L12-2 assume !(0 == main_~i~0#1); 11956#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11955#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11954#L12 assume !(10 == main_~i~0#1); 11953#L12-2 assume !(0 == main_~i~0#1); 11952#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11951#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11950#L12 assume !(10 == main_~i~0#1); 11949#L12-2 assume !(0 == main_~i~0#1); 11948#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11947#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11946#L12 assume !(10 == main_~i~0#1); 11945#L12-2 assume !(0 == main_~i~0#1); 11944#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11943#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11942#L12 assume !(10 == main_~i~0#1); 11941#L12-2 assume !(0 == main_~i~0#1); 11940#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11939#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11936#L12 assume !(10 == main_~i~0#1); 11938#L12-2 assume !(0 == main_~i~0#1); 11937#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11935#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11934#L12 assume !(10 == main_~i~0#1); 11884#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11933#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11930#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11928#L12 assume !(10 == main_~i~0#1); 11927#L12-2 assume !(0 == main_~i~0#1); 11926#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11925#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11924#L12 assume !(10 == main_~i~0#1); 11923#L12-2 assume !(0 == main_~i~0#1); 11922#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11921#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11920#L12 assume !(10 == main_~i~0#1); 11919#L12-2 assume !(0 == main_~i~0#1); 11918#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11917#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11916#L12 assume !(10 == main_~i~0#1); 11912#L12-2 assume !(0 == main_~i~0#1); 11915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11914#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11911#L12 assume !(10 == main_~i~0#1); 11894#L12-2 [2024-10-12 00:15:21,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash 781927031, now seen corresponding path program 1 times [2024-10-12 00:15:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:21,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723276734] [2024-10-12 00:15:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash 921517193, now seen corresponding path program 4 times [2024-10-12 00:15:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651689015] [2024-10-12 00:15:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:21,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:15:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 933372671, now seen corresponding path program 5 times [2024-10-12 00:15:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:15:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140863519] [2024-10-12 00:15:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:15:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:15:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:21,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:15:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:22,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:15:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:15:22,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:15:22 BoogieIcfgContainer [2024-10-12 00:15:22,316 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:15:22,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:15:22,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:15:22,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:15:22,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:15:10" (3/4) ... [2024-10-12 00:15:22,323 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:15:22,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:15:22,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:15:22,399 INFO L158 Benchmark]: Toolchain (without parser) took 12543.50ms. Allocated memory was 134.2MB in the beginning and 293.6MB in the end (delta: 159.4MB). Free memory was 66.2MB in the beginning and 178.6MB in the end (delta: -112.4MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,399 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 134.2MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:15:22,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.84ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 66.1MB in the beginning and 162.5MB in the end (delta: -96.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.04ms. Allocated memory is still 195.0MB. Free memory was 162.5MB in the beginning and 161.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,400 INFO L158 Benchmark]: Boogie Preprocessor took 21.46ms. Allocated memory is still 195.0MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,400 INFO L158 Benchmark]: RCFGBuilder took 188.48ms. Allocated memory is still 195.0MB. Free memory was 159.4MB in the beginning and 149.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,400 INFO L158 Benchmark]: BuchiAutomizer took 12011.98ms. Allocated memory was 195.0MB in the beginning and 293.6MB in the end (delta: 98.6MB). Free memory was 149.9MB in the beginning and 182.8MB in the end (delta: -32.9MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,400 INFO L158 Benchmark]: Witness Printer took 81.36ms. Allocated memory is still 293.6MB. Free memory was 182.8MB in the beginning and 178.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 00:15:22,402 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.44ms. Allocated memory is still 134.2MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.84ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 66.1MB in the beginning and 162.5MB in the end (delta: -96.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.04ms. Allocated memory is still 195.0MB. Free memory was 162.5MB in the beginning and 161.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.46ms. Allocated memory is still 195.0MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 188.48ms. Allocated memory is still 195.0MB. Free memory was 159.4MB in the beginning and 149.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 12011.98ms. Allocated memory was 195.0MB in the beginning and 293.6MB in the end (delta: 98.6MB). Free memory was 149.9MB in the beginning and 182.8MB in the end (delta: -32.9MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * Witness Printer took 81.36ms. Allocated memory is still 293.6MB. Free memory was 182.8MB in the beginning and 178.6MB 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 13 locations. The remainder module has 101 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 12 iterations. TraceHistogramMax:21. Analysis of lassos took 7.0s. Construction of modules took 0.9s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 18. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 766 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.1s 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, 523 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 201 mSDtfsCounter, 918 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: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s 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-10-12 00:15:22,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:22,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2024-10-12 00:15:22,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:23,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:15:23,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)