./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:58:34,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:58:34,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:58:34,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:58:34,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:58:34,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:58:34,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:58:34,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:58:35,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:58:35,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:58:35,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:58:35,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:58:35,004 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:58:35,004 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:58:35,004 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:58:35,005 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:58:35,005 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:58:35,005 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:58:35,006 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:58:35,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:58:35,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:58:35,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:58:35,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:58:35,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:58:35,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:58:35,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:58:35,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:58:35,014 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:58:35,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:58:35,014 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:58:35,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:58:35,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:58:35,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:58:35,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:58:35,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:58:35,015 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:58:35,015 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 [2024-10-13 16:58:35,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:58:35,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:58:35,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:58:35,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:58:35,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:58:35,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-10-13 16:58:36,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:58:36,949 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:58:36,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-10-13 16:58:36,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4633d36ac/fa8e3449355a40d6aa2f39de14d1d435/FLAGde191f6ba [2024-10-13 16:58:37,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4633d36ac/fa8e3449355a40d6aa2f39de14d1d435 [2024-10-13 16:58:37,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:58:37,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:58:37,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:58:37,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:58:37,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:58:37,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471d5138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37, skipping insertion in model container [2024-10-13 16:58:37,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:58:37,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:58:37,625 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:58:37,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:58:37,651 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:58:37,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37 WrapperNode [2024-10-13 16:58:37,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:58:37,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:58:37,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:58:37,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:58:37,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,672 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-10-13 16:58:37,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:58:37,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:58:37,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:58:37,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:58:37,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,690 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:58:37,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:58:37,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:58:37,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:58:37,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:58:37,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (1/1) ... [2024-10-13 16:58:37,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:37,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:37,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 16:58:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:58:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:58:37,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:58:37,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:58:37,900 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-13 16:58:37,900 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:58:37,919 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:58:37,923 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 16:58:37,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:37 BoogieIcfgContainer [2024-10-13 16:58:37,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:58:37,931 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:58:37,931 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:58:37,942 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:58:37,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:58:37,943 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:58:37" (1/3) ... [2024-10-13 16:58:37,944 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42052e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:58:37, skipping insertion in model container [2024-10-13 16:58:37,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:58:37,944 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:37" (2/3) ... [2024-10-13 16:58:37,944 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42052e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:58:37, skipping insertion in model container [2024-10-13 16:58:37,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:58:37,944 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:37" (3/3) ... [2024-10-13 16:58:37,950 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2024-10-13 16:58:38,056 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:58:38,057 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:58:38,057 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:58:38,057 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:58:38,057 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:58:38,057 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:58:38,057 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:58:38,057 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:58:38,065 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-13 16:58:38,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:38,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:38,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:38,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:58:38,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:38,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:58:38,105 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-13 16:58:38,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:38,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:38,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:38,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:58:38,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:38,121 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-13 16:58:38,122 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-13 16:58:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 16:58:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928453141] [2024-10-13 16:58:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:38,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:38,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-10-13 16:58:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651020450] [2024-10-13 16:58:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:38,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:38,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:38,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-10-13 16:58:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:38,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762065785] [2024-10-13 16:58:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:38,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:38,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:38,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:38,372 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:38,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:38,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:38,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:38,373 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:38,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:38,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:38,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-10-13 16:58:38,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:38,373 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:38,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,489 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:38,490 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:38,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 16:58:38,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:38,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:38,515 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:38,515 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-13 16:58:38,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 16:58:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 16:58:38,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:38,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:38,552 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:38,553 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-13 16:58:38,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 16:58:38,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,573 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 16:58:38,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:38,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:38,600 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:38,601 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-13 16:58:38,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 16:58:38,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 16:58:38,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:38,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:38,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 16:58:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 16:58:38,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:38,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:38,664 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:38,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:38,679 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:38,679 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:38,679 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:38,679 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:38,680 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:38,680 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:38,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:38,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-10-13 16:58:38,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:38,680 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:38,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:38,750 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:38,754 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 16:58:38,760 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-13 16:58:38,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:38,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:38,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:38,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:38,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:38,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:38,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:38,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-13 16:58:38,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 16:58:38,801 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-13 16:58:38,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:38,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:38,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:38,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:38,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:38,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:38,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:38,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:38,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 16:58:38,855 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-13 16:58:38,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:38,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:38,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:38,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:38,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:38,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:38,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:38,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:38,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:38,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:38,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:38,879 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:38,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 16:58:38,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:38,882 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:38,882 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:38,882 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-13 16:58:38,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 16:58:38,900 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:38,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:38,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:38,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:38,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:38,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:39,004 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-13 16:58:39,038 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-13 16:58:39,041 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-13 16:58:39,124 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-13 16:58:39,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:39,128 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-13 16:58:39,133 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-13 16:58:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-13 16:58:39,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 16:58:39,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:39,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-13 16:58:39,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:39,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-13 16:58:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:39,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-10-13 16:58:39,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-13 16:58:39,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-10-13 16:58:39,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 16:58:39,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 16:58:39,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-10-13 16:58:39,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:39,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-10-13 16:58:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-10-13 16:58:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-13 16:58:39,162 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-13 16:58:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-10-13 16:58:39,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-13 16:58:39,163 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-10-13 16:58:39,163 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:58:39,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-10-13 16:58:39,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-13 16:58:39,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:39,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:39,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 16:58:39,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:39,164 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-13 16:58:39,165 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-13 16:58:39,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-13 16:58:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:39,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862866529] [2024-10-13 16:58:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:39,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-10-13 16:58:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195322601] [2024-10-13 16:58:39,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:39,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:39,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-10-13 16:58:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:39,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250958631] [2024-10-13 16:58:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:39,219 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-13 16:58:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250958631] [2024-10-13 16:58:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250958631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:58:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:58:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595390827] [2024-10-13 16:58:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:39,265 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:39,266 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:39,266 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:39,266 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:39,266 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:39,266 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,266 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:39,266 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:39,266 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-10-13 16:58:39,266 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:39,266 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:39,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,393 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:39,393 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:39,398 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:39,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:39,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:39,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 16:58:39,424 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:39,424 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-13 16:58:39,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:39,436 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:39,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 16:58:39,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:39,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-13 16:58:39,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:39,463 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:39,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 16:58:39,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:39,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:39,548 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:39,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:39,554 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:39,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:39,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:39,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:39,554 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:39,554 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,554 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:39,554 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:39,554 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-10-13 16:58:39,554 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:39,554 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:39,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:39,672 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:39,672 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:39,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:39,673 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 16:58:39,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-13 16:58:39,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:39,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:39,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:39,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:39,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:39,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:39,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:39,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 16:58:39,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:39,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:39,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 16:58:39,712 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-13 16:58:39,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:39,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:39,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:39,722 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:58:39,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:39,724 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:58:39,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:39,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:39,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:39,730 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:39,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:39,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:39,734 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:39,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 16:58:39,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:39,739 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:39,739 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:39,739 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-13 16:58:39,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:39,756 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:39,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:39,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:39,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:39,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:39,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:39,860 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-13 16:58:39,860 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-13 16:58:39,861 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-13 16:58:39,908 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-13 16:58:39,908 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-13 16:58:39,909 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-13 16:58:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 16:58:39,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-13 16:58:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:39,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-13 16:58:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:39,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-13 16:58:39,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:39,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2024-10-13 16:58:39,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:58:39,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 35 transitions. [2024-10-13 16:58:39,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 16:58:39,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 16:58:39,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 35 transitions. [2024-10-13 16:58:39,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:39,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2024-10-13 16:58:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 35 transitions. [2024-10-13 16:58:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-13 16:58:39,920 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-13 16:58:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2024-10-13 16:58:39,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 34 transitions. [2024-10-13 16:58:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:58:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:58:39,924 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-13 16:58:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:39,951 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2024-10-13 16:58:39,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 52 transitions. [2024-10-13 16:58:39,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 16:58:39,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 46 transitions. [2024-10-13 16:58:39,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-13 16:58:39,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-13 16:58:39,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 46 transitions. [2024-10-13 16:58:39,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:39,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 46 transitions. [2024-10-13 16:58:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 46 transitions. [2024-10-13 16:58:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-13 16:58:39,964 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-13 16:58:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-10-13 16:58:39,965 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-10-13 16:58:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:58:39,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-10-13 16:58:39,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:58:39,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2024-10-13 16:58:39,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 16:58:39,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:39,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:39,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 16:58:39,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:39,970 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-13 16:58:39,970 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-13 16:58:39,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-10-13 16:58:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:39,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745343225] [2024-10-13 16:58:39,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:39,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-10-13 16:58:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:39,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885676719] [2024-10-13 16:58:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:39,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:39,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:40,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:40,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-10-13 16:58:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584980779] [2024-10-13 16:58:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:40,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:40,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:40,108 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:40,108 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:40,108 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:40,108 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:40,108 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:40,108 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,108 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:40,108 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:40,109 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-10-13 16:58:40,109 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:40,109 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:40,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,204 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:40,205 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:40,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,209 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 16:58:40,211 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:40,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:40,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-13 16:58:40,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 16:58:40,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:40,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:40,307 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:40,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:40,313 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:40,313 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:40,313 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:40,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:40,313 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:40,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:40,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:40,313 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-10-13 16:58:40,313 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:40,313 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:40,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:40,378 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,382 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 16:58:40,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-13 16:58:40,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:40,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:40,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:40,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:40,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:40,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:40,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:40,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:40,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:40,405 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:58:40,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,406 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 16:58:40,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:40,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:40,409 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:40,409 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-13 16:58:40,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 16:58:40,420 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:40,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:40,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:40,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:40,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:40,484 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-13 16:58:40,485 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-13 16:58:40,485 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-13 16:58:40,506 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-13 16:58:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:40,511 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-13 16:58:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-13 16:58:40,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-13 16:58:40,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:40,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-13 16:58:40,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:40,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-13 16:58:40,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:40,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 104 transitions. [2024-10-13 16:58:40,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:58:40,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 98 transitions. [2024-10-13 16:58:40,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-13 16:58:40,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-13 16:58:40,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 98 transitions. [2024-10-13 16:58:40,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:40,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 98 transitions. [2024-10-13 16:58:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 98 transitions. [2024-10-13 16:58:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-10-13 16:58:40,517 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-13 16:58:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 94 transitions. [2024-10-13 16:58:40,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-10-13 16:58:40,518 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-10-13 16:58:40,518 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:58:40,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 94 transitions. [2024-10-13 16:58:40,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-10-13 16:58:40,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:40,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:40,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:58:40,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:40,519 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-13 16:58:40,519 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-13 16:58:40,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-10-13 16:58:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127777242] [2024-10-13 16:58:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:40,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:40,540 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-13 16:58:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:40,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127777242] [2024-10-13 16:58:40,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127777242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:40,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:58:40,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:58:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854282757] [2024-10-13 16:58:40,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:40,541 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 2 times [2024-10-13 16:58:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704796346] [2024-10-13 16:58:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:40,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:40,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:40,565 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:40,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:40,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:40,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:40,565 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:40,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:40,565 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:40,565 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-10-13 16:58:40,565 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:40,565 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:40,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,613 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:40,613 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,618 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 16:58:40,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:40,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:40,640 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:40,641 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-13 16:58:40,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-13 16:58:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,657 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 16:58:40,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:40,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:40,676 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:40,676 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-13 16:58:40,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 16:58:40,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,690 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 16:58:40,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:40,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:40,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-13 16:58:40,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,717 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 16:58:40,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:40,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:40,731 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:40,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-13 16:58:40,747 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:40,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:40,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:40,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:40,748 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:40,748 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:40,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:40,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-10-13 16:58:40,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:40,748 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:40,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:40,831 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:40,832 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,835 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-13 16:58:40,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 16:58:40,846 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-13 16:58:40,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-13 16:58:40,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:40,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:40,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:40,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:40,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:40,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:40,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:40,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-13 16:58:40,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,880 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 16:58:40,883 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-13 16:58:40,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:40,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:40,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:40,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:40,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:40,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:40,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:40,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:40,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:40,899 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:40,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:40,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:40,901 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:40,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 16:58:40,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:40,903 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:40,903 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:40,904 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-13 16:58:40,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-13 16:58:40,922 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:40,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:40,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:40,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:40,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:40,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:40,996 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-13 16:58:40,997 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-13 16:58:40,997 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-13 16:58:41,036 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-13 16:58:41,044 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-13 16:58:41,045 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-13 16:58:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-13 16:58:41,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-13 16:58:41,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:58:41,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 8 letters. [2024-10-13 16:58:41,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 190 transitions. [2024-10-13 16:58:41,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-13 16:58:41,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 107 states and 175 transitions. [2024-10-13 16:58:41,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-13 16:58:41,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-13 16:58:41,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 175 transitions. [2024-10-13 16:58:41,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:41,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 175 transitions. [2024-10-13 16:58:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 175 transitions. [2024-10-13 16:58:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2024-10-13 16:58:41,062 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-13 16:58:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2024-10-13 16:58:41,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 161 transitions. [2024-10-13 16:58:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:58:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:58:41,064 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-13 16:58:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:41,080 INFO L93 Difference]: Finished difference Result 107 states and 163 transitions. [2024-10-13 16:58:41,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 163 transitions. [2024-10-13 16:58:41,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2024-10-13 16:58:41,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 153 transitions. [2024-10-13 16:58:41,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-13 16:58:41,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-13 16:58:41,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 153 transitions. [2024-10-13 16:58:41,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:41,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-10-13 16:58:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 153 transitions. [2024-10-13 16:58:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-10-13 16:58:41,096 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-13 16:58:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-10-13 16:58:41,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-10-13 16:58:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:58:41,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-10-13 16:58:41,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:58:41,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 148 transitions. [2024-10-13 16:58:41,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-10-13 16:58:41,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:41,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:41,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2024-10-13 16:58:41,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:41,103 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-13 16:58:41,103 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-13 16:58:41,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1506873443, now seen corresponding path program 1 times [2024-10-13 16:58:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:41,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789124332] [2024-10-13 16:58:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,141 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-13 16:58:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789124332] [2024-10-13 16:58:41,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789124332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:41,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:58:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:58:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209286164] [2024-10-13 16:58:41,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:41,143 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:41,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 3 times [2024-10-13 16:58:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202133392] [2024-10-13 16:58:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:41,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:41,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:41,184 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:41,184 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:41,184 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:41,184 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:41,184 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:41,184 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,184 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:41,184 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:41,184 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-10-13 16:58:41,184 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:41,184 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:41,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,252 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:41,252 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:41,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:41,257 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 16:58:41,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:41,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:41,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:41,290 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:41,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 16:58:41,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:41,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:41,308 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:41,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:41,319 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:41,320 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:41,320 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:41,320 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:41,320 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:41,320 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,320 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:41,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:41,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-10-13 16:58:41,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:41,320 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:41,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:41,365 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:41,365 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:41,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:41,369 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:41,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 16:58:41,371 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-13 16:58:41,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:41,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:41,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:41,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:41,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:41,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:41,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:41,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:41,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:41,399 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:41,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 16:58:41,401 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-13 16:58:41,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:41,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:41,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:41,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:41,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:41,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:41,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:41,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:41,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:41,416 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:41,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:41,418 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:41,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 16:58:41,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:41,424 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:41,424 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:41,424 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-13 16:58:41,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:41,436 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:41,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,512 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-13 16:58:41,512 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-13 16:58:41,513 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-13 16:58:41,558 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-13 16:58:41,561 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-13 16:58:41,566 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-13 16:58:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-13 16:58:41,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:58:41,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,569 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:41,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,642 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-13 16:58:41,643 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-13 16:58:41,643 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-13 16:58:41,677 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-13 16:58:41,682 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-13 16:58:41,683 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-13 16:58:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-13 16:58:41,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:58:41,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,683 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,762 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-13 16:58:41,763 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-13 16:58:41,763 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-13 16:58:41,798 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-13 16:58:41,801 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-13 16:58:41,802 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-13 16:58:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-13 16:58:41,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:58:41,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-13 16:58:41,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-13 16:58:41,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:41,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 250 transitions. [2024-10-13 16:58:41,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2024-10-13 16:58:41,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 119 states and 180 transitions. [2024-10-13 16:58:41,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-10-13 16:58:41,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-10-13 16:58:41,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 180 transitions. [2024-10-13 16:58:41,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:41,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-10-13 16:58:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 180 transitions. [2024-10-13 16:58:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2024-10-13 16:58:41,818 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-13 16:58:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-10-13 16:58:41,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-10-13 16:58:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:41,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:58:41,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:58:41,819 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-13 16:58:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:41,836 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-10-13 16:58:41,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2024-10-13 16:58:41,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-13 16:58:41,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 68 transitions. [2024-10-13 16:58:41,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-13 16:58:41,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-13 16:58:41,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 68 transitions. [2024-10-13 16:58:41,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:41,839 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-10-13 16:58:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 68 transitions. [2024-10-13 16:58:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-10-13 16:58:41,845 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-13 16:58:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-13 16:58:41,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-13 16:58:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:58:41,846 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-13 16:58:41,846 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 16:58:41,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2024-10-13 16:58:41,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-13 16:58:41,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:41,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:41,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:41,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:41,847 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-13 16:58:41,847 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-13 16:58:41,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1179049836, now seen corresponding path program 1 times [2024-10-13 16:58:41,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:41,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602182222] [2024-10-13 16:58:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:41,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,914 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-13 16:58:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602182222] [2024-10-13 16:58:41,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602182222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280528620] [2024-10-13 16:58:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:41,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:41,916 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:41,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-13 16:58:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:41,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 16:58:41,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:41,958 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-13 16:58:41,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:41,983 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-13 16:58:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280528620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:41,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 16:58:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446943510] [2024-10-13 16:58:41,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:41,987 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:41,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 2 times [2024-10-13 16:58:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137748015] [2024-10-13 16:58:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:41,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:41,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:42,033 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:42,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:42,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:42,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:42,033 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:42,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:42,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:42,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-10-13 16:58:42,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:42,034 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:42,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,102 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:42,102 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:42,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:42,107 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:42,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 16:58:42,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:42,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:42,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-13 16:58:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:42,138 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:42,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 16:58:42,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:42,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:42,205 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:42,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:42,210 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:42,210 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:42,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:42,210 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:42,210 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:42,211 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,211 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:42,211 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:42,211 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-10-13 16:58:42,211 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:42,211 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:42,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,305 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:42,305 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:42,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:42,311 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:42,317 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-13 16:58:42,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 16:58:42,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:42,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:42,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:42,338 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:58:42,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:42,338 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:58:42,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:42,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:42,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:42,343 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:58:42,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:42,348 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:42,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 16:58:42,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:42,350 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:42,350 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:42,350 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-13 16:58:42,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-13 16:58:42,365 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:42,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:42,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:42,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:42,453 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-13 16:58:42,454 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:58:42,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-13 16:58:42,455 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-13 16:58:42,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-13 16:58:42,493 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-13 16:58:42,493 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-13 16:58:42,493 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-13 16:58:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 16:58:42,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-13 16:58:42,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:42,494 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:42,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:42,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:42,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:42,568 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-13 16:58:42,568 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-13 16:58:42,569 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-13 16:58:42,593 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-13 16:58:42,597 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-13 16:58:42,598 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-13 16:58:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 16:58:42,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-13 16:58:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:42,598 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:42,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:42,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:42,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:42,664 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-13 16:58:42,665 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-13 16:58:42,665 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-13 16:58:42,701 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-13 16:58:42,702 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-13 16:58:42,702 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-13 16:58:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-13 16:58:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-13 16:58:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-13 16:58:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 8 letters. [2024-10-13 16:58:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:42,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 124 transitions. [2024-10-13 16:58:42,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-10-13 16:58:42,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 56 states and 76 transitions. [2024-10-13 16:58:42,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 16:58:42,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-13 16:58:42,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2024-10-13 16:58:42,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:42,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-13 16:58:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2024-10-13 16:58:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-10-13 16:58:42,707 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-13 16:58:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-10-13 16:58:42,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-10-13 16:58:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:58:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:58:42,708 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-13 16:58:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:42,764 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-10-13 16:58:42,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2024-10-13 16:58:42,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-10-13 16:58:42,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 72 states and 93 transitions. [2024-10-13 16:58:42,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-13 16:58:42,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-10-13 16:58:42,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2024-10-13 16:58:42,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:42,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-10-13 16:58:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2024-10-13 16:58:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-10-13 16:58:42,771 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-13 16:58:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-13 16:58:42,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-13 16:58:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:58:42,772 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-13 16:58:42,772 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 16:58:42,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 85 transitions. [2024-10-13 16:58:42,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:42,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:42,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:42,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:58:42,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:42,773 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-13 16:58:42,773 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-13 16:58:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 2 times [2024-10-13 16:58:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782819306] [2024-10-13 16:58:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:42,824 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-13 16:58:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:42,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782819306] [2024-10-13 16:58:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782819306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:58:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:58:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477002374] [2024-10-13 16:58:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:42,825 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-10-13 16:58:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934862431] [2024-10-13 16:58:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:42,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:42,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:42,876 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:42,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:42,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:42,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:42,876 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:42,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:42,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:42,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-10-13 16:58:42,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:42,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:42,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:42,975 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:42,975 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:42,979 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:42,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 16:58:42,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:42,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,006 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:43,007 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-13 16:58:43,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,019 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 16:58:43,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:43,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,047 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:43,047 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-13 16:58:43,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,059 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 16:58:43,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:43,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,084 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 16:58:43,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:43,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,098 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:43,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-13 16:58:43,109 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:43,109 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:43,109 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:43,109 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:43,109 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:43,109 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,109 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:43,109 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:43,109 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-10-13 16:58:43,109 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:43,109 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:43,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,161 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:43,162 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,164 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 16:58:43,165 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-13 16:58:43,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:43,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:43,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:43,176 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:58:43,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:43,177 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:58:43,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:43,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:43,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-13 16:58:43,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,190 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 16:58:43,191 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-13 16:58:43,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:43,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:43,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:43,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:43,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:43,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:43,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:43,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,218 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 16:58:43,221 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-13 16:58:43,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:43,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:43,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:43,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:43,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:43,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:43,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:43,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,247 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 16:58:43,248 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-13 16:58:43,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:43,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:43,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:43,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:43,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:43,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:43,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:43,267 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:43,269 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:43,269 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:58:43,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,280 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 16:58:43,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:43,286 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:43,286 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:43,286 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-13 16:58:43,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 16:58:43,299 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:43,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:43,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:43,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:43,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:43,370 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-13 16:58:43,370 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-13 16:58:43,370 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-13 16:58:43,391 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-13 16:58:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:58:43,395 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-13 16:58:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-13 16:58:43,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-13 16:58:43,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:43,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-10-13 16:58:43,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:43,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-10-13 16:58:43,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:43,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 209 transitions. [2024-10-13 16:58:43,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:43,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 126 states and 161 transitions. [2024-10-13 16:58:43,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-13 16:58:43,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-13 16:58:43,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 161 transitions. [2024-10-13 16:58:43,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:43,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-10-13 16:58:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 161 transitions. [2024-10-13 16:58:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-10-13 16:58:43,400 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-13 16:58:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2024-10-13 16:58:43,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2024-10-13 16:58:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:43,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:58:43,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:58:43,400 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-13 16:58:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:43,432 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2024-10-13 16:58:43,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 174 transitions. [2024-10-13 16:58:43,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-10-13 16:58:43,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 174 transitions. [2024-10-13 16:58:43,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-13 16:58:43,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-13 16:58:43,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 174 transitions. [2024-10-13 16:58:43,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:43,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 174 transitions. [2024-10-13 16:58:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 174 transitions. [2024-10-13 16:58:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-10-13 16:58:43,436 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-13 16:58:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2024-10-13 16:58:43,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-10-13 16:58:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:58:43,437 INFO L425 stractBuchiCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-10-13 16:58:43,437 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 16:58:43,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 147 transitions. [2024-10-13 16:58:43,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:58:43,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:43,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:43,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2024-10-13 16:58:43,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:58:43,438 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-13 16:58:43,438 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-13 16:58:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 3 times [2024-10-13 16:58:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850288503] [2024-10-13 16:58:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:43,499 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-13 16:58:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850288503] [2024-10-13 16:58:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850288503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967318881] [2024-10-13 16:58:43,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 16:58:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,501 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-10-13 16:58:43,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 16:58:43,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:43,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:43,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:43,573 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-13 16:58:43,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:43,621 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-13 16:58:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967318881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:43,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:43,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2024-10-13 16:58:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086141214] [2024-10-13 16:58:43,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:43,621 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:58:43,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-10-13 16:58:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562940900] [2024-10-13 16:58:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:43,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:43,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:43,670 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:43,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:43,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:43,674 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:43,674 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:43,674 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,674 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:43,674 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:43,674 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-10-13 16:58:43,674 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:43,674 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:43,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,746 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:43,746 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,747 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 16:58:43,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:43,751 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,769 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:43,769 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-13 16:58:43,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,780 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 16:58:43,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:43,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,806 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 16:58:43,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:43,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:43,819 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:43,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,830 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:43,830 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:43,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:43,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:43,830 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:43,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:43,831 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:43,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-10-13 16:58:43,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:43,831 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:43,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:43,881 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:43,882 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,884 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 16:58:43,886 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-13 16:58:43,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:43,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:43,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:43,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:43,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:43,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:43,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:43,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-13 16:58:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,914 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-13 16:58:43,916 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-13 16:58:43,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:43,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:43,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:43,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:43,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:43,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:43,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:43,928 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:43,930 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:43,930 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:58:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:43,931 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:43,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 16:58:43,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:43,934 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:43,934 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:43,934 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-13 16:58:43,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:43,945 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:43,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:43,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:43,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:43,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:43,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:43,995 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-13 16:58:43,995 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-13 16:58:43,995 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-13 16:58:44,011 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-13 16:58:44,012 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-13 16:58:44,012 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-13 16:58:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-13 16:58:44,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-13 16:58:44,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:44,013 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:44,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:44,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:44,063 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-13 16:58:44,063 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-13 16:58:44,063 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-13 16:58:44,081 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-13 16:58:44,082 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-13 16:58:44,082 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-13 16:58:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-10-13 16:58:44,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-13 16:58:44,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:44,083 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:44,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:58:44,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:44,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-13 16:58:44,157 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-13 16:58:44,158 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-13 16:58:44,158 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-13 16:58:44,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:44,175 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-13 16:58:44,176 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-13 16:58:44,176 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-13 16:58:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-10-13 16:58:44,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-13 16:58:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2024-10-13 16:58:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:44,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2024-10-13 16:58:44,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:44,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 219 transitions. [2024-10-13 16:58:44,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-13 16:58:44,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 121 states and 151 transitions. [2024-10-13 16:58:44,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-13 16:58:44,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-13 16:58:44,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 151 transitions. [2024-10-13 16:58:44,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:44,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 151 transitions. [2024-10-13 16:58:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 151 transitions. [2024-10-13 16:58:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2024-10-13 16:58:44,180 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-13 16:58:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-10-13 16:58:44,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-10-13 16:58:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:44,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 16:58:44,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-13 16:58:44,181 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-13 16:58:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:44,238 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2024-10-13 16:58:44,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 194 transitions. [2024-10-13 16:58:44,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2024-10-13 16:58:44,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 153 states and 188 transitions. [2024-10-13 16:58:44,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 16:58:44,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 16:58:44,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 188 transitions. [2024-10-13 16:58:44,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:44,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 188 transitions. [2024-10-13 16:58:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 188 transitions. [2024-10-13 16:58:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 104. [2024-10-13 16:58:44,242 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-13 16:58:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-10-13 16:58:44,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-13 16:58:44,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 16:58:44,243 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-10-13 16:58:44,243 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 16:58:44,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 126 transitions. [2024-10-13 16:58:44,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-10-13 16:58:44,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:44,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:44,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-13 16:58:44,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 6, 5, 1, 1] [2024-10-13 16:58:44,245 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-13 16:58:44,245 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-13 16:58:44,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 2 times [2024-10-13 16:58:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:44,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825824872] [2024-10-13 16:58:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:44,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:44,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1466490324, now seen corresponding path program 1 times [2024-10-13 16:58:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534722881] [2024-10-13 16:58:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,345 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-13 16:58:44,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:44,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534722881] [2024-10-13 16:58:44,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534722881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:44,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249264469] [2024-10-13 16:58:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:44,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:44,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:44,347 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:44,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-10-13 16:58:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 16:58:44,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:44,436 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-13 16:58:44,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:44,547 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-13 16:58:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249264469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:44,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-13 16:58:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555879477] [2024-10-13 16:58:44,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:44,548 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 16:58:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 16:58:44,548 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-13 16:58:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:44,645 INFO L93 Difference]: Finished difference Result 198 states and 243 transitions. [2024-10-13 16:58:44,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 243 transitions. [2024-10-13 16:58:44,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2024-10-13 16:58:44,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 173 states and 213 transitions. [2024-10-13 16:58:44,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 16:58:44,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 16:58:44,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 213 transitions. [2024-10-13 16:58:44,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:44,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-10-13 16:58:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 213 transitions. [2024-10-13 16:58:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-10-13 16:58:44,648 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-13 16:58:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2024-10-13 16:58:44,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-10-13 16:58:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 16:58:44,650 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-10-13 16:58:44,650 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 16:58:44,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 201 transitions. [2024-10-13 16:58:44,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2024-10-13 16:58:44,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:44,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:44,651 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-13 16:58:44,651 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2024-10-13 16:58:44,651 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-13 16:58:44,651 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-13 16:58:44,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 3 times [2024-10-13 16:58:44,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:44,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724890866] [2024-10-13 16:58:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:44,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:44,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:44,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:44,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 726843037, now seen corresponding path program 2 times [2024-10-13 16:58:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:44,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036120820] [2024-10-13 16:58:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:44,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:44,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:44,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1110135673, now seen corresponding path program 4 times [2024-10-13 16:58:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:44,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906479814] [2024-10-13 16:58:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:44,775 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-13 16:58:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906479814] [2024-10-13 16:58:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906479814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:58:44,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753633166] [2024-10-13 16:58:44,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:58:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:58:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:44,780 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:58:44,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-10-13 16:58:44,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:58:44,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:58:44,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:58:44,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:44,872 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-13 16:58:44,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:58:44,995 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-13 16:58:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753633166] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:58:44,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:58:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-10-13 16:58:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126416230] [2024-10-13 16:58:44,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:58:45,352 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:45,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:45,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:45,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:45,352 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:58:45,352 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,352 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:45,352 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:45,352 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-10-13 16:58:45,352 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:45,352 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:45,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:45,396 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:58:45,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:45,400 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:45,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-13 16:58:45,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:45,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:45,423 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:58:45,423 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-13 16:58:45,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:45,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:45,439 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:45,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-13 16:58:45,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:58:45,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:45,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-13 16:58:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:45,480 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:45,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-13 16:58:45,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:58:45,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:58:45,507 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:58:45,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:45,518 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:58:45,518 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:58:45,518 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:58:45,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:58:45,518 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:58:45,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:58:45,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:58:45,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-10-13 16:58:45,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:58:45,518 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:58:45,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:58:45,566 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:58:45,566 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:58:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:45,568 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:45,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-13 16:58:45,569 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-13 16:58:45,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:45,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:45,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:45,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:45,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:58:45,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:58:45,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:58:45,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-13 16:58:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:45,599 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:45,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-13 16:58:45,603 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-13 16:58:45,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:58:45,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:58:45,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:58:45,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:58:45,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:58:45,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:58:45,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:58:45,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:58:45,618 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:58:45,618 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:58:45,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:58:45,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:58:45,621 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:58:45,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-13 16:58:45,622 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:58:45,622 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:58:45,623 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:58:45,623 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-13 16:58:45,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:45,634 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:58:45,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:45,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:45,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:45,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:58:45,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:45,792 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-13 16:58:45,793 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-13 16:58:45,794 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-13 16:58:45,875 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-13 16:58:45,875 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-13 16:58:45,876 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-13 16:58:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2024-10-13 16:58:45,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-13 16:58:45,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:45,876 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:45,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:45,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:45,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:58:45,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:46,021 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-13 16:58:46,021 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-13 16:58:46,021 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-13 16:58:46,215 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-13 16:58:46,215 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-13 16:58:46,216 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-13 16:58:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2024-10-13 16:58:46,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-13 16:58:46,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:46,216 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:46,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:46,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:46,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:46,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:58:46,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:46,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-13 16:58:46,378 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-13 16:58:46,379 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-13 16:58:46,379 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-13 16:58:46,562 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-13 16:58:46,563 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-13 16:58:46,563 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-13 16:58:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2024-10-13 16:58:46,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 76 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-13 16:58:46,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:46,565 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:58:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:46,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:58:46,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:46,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:58:46,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:58:46,710 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-13 16:58:46,711 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-13 16:58:46,711 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-13 16:58:46,906 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-13 16:58:46,906 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-13 16:58:46,907 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-13 16:58:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2024-10-13 16:58:46,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 64 letters. [2024-10-13 16:58:46,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:46,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 71 letters. Loop has 64 letters. [2024-10-13 16:58:46,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:46,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 128 letters. [2024-10-13 16:58:46,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:58:46,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1639 states and 1887 transitions. [2024-10-13 16:58:46,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-10-13 16:58:46,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1639 states to 522 states and 614 transitions. [2024-10-13 16:58:46,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-10-13 16:58:46,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2024-10-13 16:58:46,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 614 transitions. [2024-10-13 16:58:46,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:46,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 614 transitions. [2024-10-13 16:58:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 614 transitions. [2024-10-13 16:58:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 163. [2024-10-13 16:58:46,920 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-13 16:58:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-10-13 16:58:46,920 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-10-13 16:58:46,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:46,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 16:58:46,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 16:58:46,921 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-13 16:58:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:46,965 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2024-10-13 16:58:46,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 454 transitions. [2024-10-13 16:58:46,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 195 [2024-10-13 16:58:46,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 298 states and 353 transitions. [2024-10-13 16:58:46,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-10-13 16:58:46,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-10-13 16:58:46,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 353 transitions. [2024-10-13 16:58:46,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:46,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 353 transitions. [2024-10-13 16:58:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 353 transitions. [2024-10-13 16:58:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 152. [2024-10-13 16:58:46,970 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-13 16:58:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2024-10-13 16:58:46,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-10-13 16:58:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 16:58:46,971 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-10-13 16:58:46,971 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 16:58:46,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 183 transitions. [2024-10-13 16:58:46,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2024-10-13 16:58:46,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:46,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:46,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-13 16:58:46,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 20, 19, 11, 10, 2, 1] [2024-10-13 16:58:46,972 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-13 16:58:46,972 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-13 16:58:46,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 4 times [2024-10-13 16:58:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795476024] [2024-10-13 16:58:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:46,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:46,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:46,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1840948782, now seen corresponding path program 3 times [2024-10-13 16:58:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020487482] [2024-10-13 16:58:46,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:46,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:58:47,013 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-13 16:58:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:58:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020487482] [2024-10-13 16:58:47,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020487482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:58:47,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:58:47,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:58:47,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629523592] [2024-10-13 16:58:47,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:58:47,014 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:58:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:58:47,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:58:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:58:47,015 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-13 16:58:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:58:47,027 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2024-10-13 16:58:47,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 181 transitions. [2024-10-13 16:58:47,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-10-13 16:58:47,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 144 states and 170 transitions. [2024-10-13 16:58:47,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-10-13 16:58:47,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-13 16:58:47,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. [2024-10-13 16:58:47,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:58:47,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-10-13 16:58:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. [2024-10-13 16:58:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2024-10-13 16:58:47,030 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-13 16:58:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2024-10-13 16:58:47,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-10-13 16:58:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:58:47,031 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-10-13 16:58:47,031 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 16:58:47,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2024-10-13 16:58:47,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-10-13 16:58:47,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:58:47,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:58:47,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 1, 1, 1] [2024-10-13 16:58:47,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-10-13 16:58:47,032 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-13 16:58:47,032 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-13 16:58:47,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash 781927031, now seen corresponding path program 1 times [2024-10-13 16:58:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:47,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861768830] [2024-10-13 16:58:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:47,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 921517193, now seen corresponding path program 4 times [2024-10-13 16:58:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733357574] [2024-10-13 16:58:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:58:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 933372671, now seen corresponding path program 5 times [2024-10-13 16:58:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:58:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276343948] [2024-10-13 16:58:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:58:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:58:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:58:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:58:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:58:47,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 04:58:47 BoogieIcfgContainer [2024-10-13 16:58:47,574 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 16:58:47,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:58:47,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:58:47,575 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:58:47,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:37" (3/4) ... [2024-10-13 16:58:47,576 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 16:58:47,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:58:47,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:58:47,616 INFO L158 Benchmark]: Toolchain (without parser) took 10238.49ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 95.4MB in the beginning and 128.9MB in the end (delta: -33.5MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-13 16:58:47,616 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 104.9MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:58:47,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.64ms. Allocated memory is still 161.5MB. Free memory was 95.2MB in the beginning and 132.7MB in the end (delta: -37.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 16:58:47,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.60ms. Allocated memory is still 161.5MB. Free memory was 132.7MB in the beginning and 131.7MB in the end (delta: 988.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:58:47,617 INFO L158 Benchmark]: Boogie Preprocessor took 27.72ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 130.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:58:47,617 INFO L158 Benchmark]: RCFGBuilder took 228.65ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 121.2MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:58:47,617 INFO L158 Benchmark]: BuchiAutomizer took 9643.23ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 120.6MB in the beginning and 132.1MB in the end (delta: -11.4MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-10-13 16:58:47,618 INFO L158 Benchmark]: Witness Printer took 40.98ms. Allocated memory is still 245.4MB. Free memory was 132.1MB in the beginning and 128.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:58:47,619 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.43ms. Allocated memory is still 104.9MB. Free memory was 74.9MB in the beginning and 74.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.64ms. Allocated memory is still 161.5MB. Free memory was 95.2MB in the beginning and 132.7MB in the end (delta: -37.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.60ms. Allocated memory is still 161.5MB. Free memory was 132.7MB in the beginning and 131.7MB in the end (delta: 988.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.72ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 130.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 228.65ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 121.2MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9643.23ms. Allocated memory was 161.5MB in the beginning and 245.4MB in the end (delta: 83.9MB). Free memory was 120.6MB in the beginning and 132.1MB in the end (delta: -11.4MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Witness Printer took 40.98ms. Allocated memory is still 245.4MB. Free memory was 132.1MB in the beginning and 128.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 9.5s and 12 iterations. TraceHistogramMax:21. Analysis of lassos took 5.9s. Construction of modules took 0.6s. Büchi inclusion checks took 2.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.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 220/480 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.7s 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: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s 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-13 16:58:47,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:47,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:48,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2024-10-13 16:58:48,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-10-13 16:58:48,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)