./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:16:07,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:16:07,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:16:07,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:16:07,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:16:07,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:16:07,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:16:07,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:16:07,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:16:07,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:16:07,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:16:07,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:16:07,899 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:16:07,899 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:16:07,901 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:16:07,902 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:16:07,902 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:16:07,902 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:16:07,902 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:16:07,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:16:07,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:16:07,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:16:07,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:16:07,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:16:07,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:16:07,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:16:07,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:16:07,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:16:07,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:16:07,909 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:16:07,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:16:07,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:16:07,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:16:07,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:16:07,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:16:07,911 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:16:07,911 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 [2024-11-19 14:16:08,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:16:08,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:16:08,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:16:08,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:16:08,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:16:08,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-11-19 14:16:09,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:16:09,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:16:09,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-11-19 14:16:09,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62f0bcf2/7c86afafcb9348b5be7cae7969affc4b/FLAG183cb6af0 [2024-11-19 14:16:09,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62f0bcf2/7c86afafcb9348b5be7cae7969affc4b [2024-11-19 14:16:09,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:16:09,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:16:09,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:16:09,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:16:09,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:16:09,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:09,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85ca14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09, skipping insertion in model container [2024-11-19 14:16:09,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:09,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:16:09,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:16:09,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:16:09,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:16:09,971 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:16:09,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09 WrapperNode [2024-11-19 14:16:09,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:16:09,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:16:09,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:16:09,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:16:09,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:09,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:09,997 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-19 14:16:09,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:16:09,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:16:09,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:16:09,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:16:10,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,012 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:16:10,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:16:10,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:16:10,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:16:10,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:16:10,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (1/1) ... [2024-11-19 14:16:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:16:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:16:10,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:16:10,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:16:10,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:16:10,223 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-19 14:16:10,224 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:16:10,242 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:16:10,242 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:16:10,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:16:10 BoogieIcfgContainer [2024-11-19 14:16:10,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:16:10,244 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:16:10,244 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:16:10,247 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:16:10,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:16:10,249 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:16:09" (1/3) ... [2024-11-19 14:16:10,250 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f5e9172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:16:10, skipping insertion in model container [2024-11-19 14:16:10,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:16:10,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:16:09" (2/3) ... [2024-11-19 14:16:10,250 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f5e9172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:16:10, skipping insertion in model container [2024-11-19 14:16:10,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:16:10,251 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:16:10" (3/3) ... [2024-11-19 14:16:10,252 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2024-11-19 14:16:10,303 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:16:10,303 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:16:10,303 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:16:10,304 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:16:10,304 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:16:10,304 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:16:10,305 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:16:10,305 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:16:10,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:10,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:16:10,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:10,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:10,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:16:10,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:10,333 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:16:10,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:10,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:16:10,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:10,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:10,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:16:10,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:10,346 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2024-11-19 14:16:10,346 INFO L747 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10#L12true assume !(10 == main_~i~0#1); 2#L12-2true assume 0 == main_~i~0#1;main_~up~0#1 := 1; 7#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2024-11-19 14:16:10,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:16:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531154012] [2024-11-19 14:16:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:10,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-19 14:16:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:10,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501820316] [2024-11-19 14:16:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:10,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-11-19 14:16:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:10,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220085940] [2024-11-19 14:16:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:10,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:10,624 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:10,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:10,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:10,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:10,625 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:10,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:10,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:10,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-11-19 14:16:10,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:10,626 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:10,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,729 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:10,729 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:10,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:16:10,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:10,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:10,758 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:10,758 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:10,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:16:10,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:10,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:10,804 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:10,805 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:10,816 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-11-19 14:16:10,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:16:10,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:10,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:10,845 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:10,845 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:10,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:16:10,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:16:10,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:10,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:10,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:16:10,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:10,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:10,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:16:10,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:10,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:10,907 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:10,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:10,919 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:10,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:10,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:10,919 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:10,919 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:10,919 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:10,919 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:10,919 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:10,920 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-11-19 14:16:10,920 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:10,920 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:10,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:10,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:11,005 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:11,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:16:11,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:11,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:11,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:11,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:11,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:11,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:11,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:11,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:11,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:16:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:16:11,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:11,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:11,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:11,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:11,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:11,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:11,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:11,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:11,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:16:11,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:16:11,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:11,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:11,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:11,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:11,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:11,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:11,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:11,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:11,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:11,138 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:11,139 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:11,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,221 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:16:11,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:11,223 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:11,224 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:11,224 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-19 14:16:11,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:16:11,238 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:11,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:11,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:11,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:11,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:11,358 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:11,360 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:11,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 45 transitions. Complement of second has 8 states. [2024-11-19 14:16:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-19 14:16:11,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:16:11,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:11,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:16:11,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-19 14:16:11,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:11,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-11-19 14:16:11,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:16:11,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-11-19 14:16:11,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:16:11,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:16:11,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-11-19 14:16:11,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:11,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-11-19 14:16:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-11-19 14:16:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-19 14:16:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-11-19 14:16:11,487 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-19 14:16:11,487 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-19 14:16:11,487 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:16:11,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-11-19 14:16:11,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 14:16:11,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:11,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:11,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:16:11,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:11,491 INFO L745 eck$LassoCheckResult]: Stem: 92#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 93#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 97#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 89#L12 [2024-11-19 14:16:11,491 INFO L747 eck$LassoCheckResult]: Loop: 89#L12 assume !(10 == main_~i~0#1); 98#L12-2 assume !(0 == main_~i~0#1); 99#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 88#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 89#L12 [2024-11-19 14:16:11,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-19 14:16:11,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:11,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299118477] [2024-11-19 14:16:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-11-19 14:16:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:11,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629454513] [2024-11-19 14:16:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:11,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:11,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:11,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-11-19 14:16:11,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807011026] [2024-11-19 14:16:11,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:11,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807011026] [2024-11-19 14:16:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807011026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:11,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:11,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:16:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124479602] [2024-11-19 14:16:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:11,644 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:11,644 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:11,644 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:11,644 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:11,645 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:11,645 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,645 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:11,645 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:11,645 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-11-19 14:16:11,645 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:11,645 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:11,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,754 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:11,755 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:11,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:16:11,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:11,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,783 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:11,783 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:11,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:16:11,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:16:11,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:11,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:11,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:11,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:11,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:16:11,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:11,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:11,921 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:11,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:11,926 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:11,926 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:11,926 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:11,926 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:11,926 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:11,926 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:11,926 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:11,926 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:11,926 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-11-19 14:16:11,926 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:11,926 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:11,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:11,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,016 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,016 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,017 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:16:12,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:12,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:12,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:12,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:12,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:12,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:12,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:12,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:12,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:16:12,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,054 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:16:12,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:12,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:12,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:12,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:12,069 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:16:12,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:12,070 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:16:12,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:12,073 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:12,076 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:12,076 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,078 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:16:12,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:12,080 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:12,080 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:12,080 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2024-11-19 14:16:12,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,096 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:12,174 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:12,174 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 43 transitions. Complement of second has 7 states. [2024-11-19 14:16:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:16:12,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-19 14:16:12,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-19 14:16:12,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-19 14:16:12,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2024-11-19 14:16:12,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:16:12,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 35 transitions. [2024-11-19 14:16:12,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:16:12,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:16:12,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 35 transitions. [2024-11-19 14:16:12,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:12,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2024-11-19 14:16:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 35 transitions. [2024-11-19 14:16:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-19 14:16:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2024-11-19 14:16:12,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 34 transitions. [2024-11-19 14:16:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:16:12,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:16:12,226 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:12,238 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2024-11-19 14:16:12,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 52 transitions. [2024-11-19 14:16:12,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:16:12,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 46 transitions. [2024-11-19 14:16:12,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-19 14:16:12,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-19 14:16:12,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 46 transitions. [2024-11-19 14:16:12,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:12,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 46 transitions. [2024-11-19 14:16:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 46 transitions. [2024-11-19 14:16:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-19 14:16:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-11-19 14:16:12,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-19 14:16:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:16:12,249 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-19 14:16:12,250 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:16:12,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2024-11-19 14:16:12,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-19 14:16:12,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:12,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:12,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:16:12,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:12,252 INFO L745 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 244#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 226#L12-2 assume !(0 == main_~i~0#1); 228#L15-1 [2024-11-19 14:16:12,252 INFO L747 eck$LassoCheckResult]: Loop: 228#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 237#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 248#L12 assume !(10 == main_~i~0#1); 246#L12-2 assume !(0 == main_~i~0#1); 228#L15-1 [2024-11-19 14:16:12,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-11-19 14:16:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628814494] [2024-11-19 14:16:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-11-19 14:16:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070077363] [2024-11-19 14:16:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-11-19 14:16:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354375604] [2024-11-19 14:16:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,324 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:12,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:12,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:12,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:12,325 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:12,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:12,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:12,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-11-19 14:16:12,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:12,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:12,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,397 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,398 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:12,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,400 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:16:12,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:16:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,437 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:16:12,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:12,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,516 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:12,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:16:12,521 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:12,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:12,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:12,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:12,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:12,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:12,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:12,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-11-19 14:16:12,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:12,522 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:12,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,597 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,597 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,620 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:16:12,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:12,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:12,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:12,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:12,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:12,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:12,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:12,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:12,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:12,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:12,640 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:12,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,641 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:16:12,643 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:12,643 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:12,643 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:12,643 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:12,654 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-11-19 14:16:12,655 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:12,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:12,712 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:16:12,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 45 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 45 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 104 transitions. Complement of second has 7 states. [2024-11-19 14:16:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:12,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-19 14:16:12,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-19 14:16:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-19 14:16:12,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:12,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 104 transitions. [2024-11-19 14:16:12,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-19 14:16:12,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 98 transitions. [2024-11-19 14:16:12,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:16:12,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-19 14:16:12,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 98 transitions. [2024-11-19 14:16:12,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:12,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 98 transitions. [2024-11-19 14:16:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 98 transitions. [2024-11-19 14:16:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-19 14:16:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 55 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 94 transitions. [2024-11-19 14:16:12,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-11-19 14:16:12,769 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-11-19 14:16:12,769 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:16:12,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 94 transitions. [2024-11-19 14:16:12,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-19 14:16:12,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:12,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:12,773 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:16:12,773 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:12,774 INFO L745 eck$LassoCheckResult]: Stem: 379#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 384#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 412#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 408#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 407#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 404#L18-1 [2024-11-19 14:16:12,774 INFO L747 eck$LassoCheckResult]: Loop: 404#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 397#L12 assume !(10 == main_~i~0#1); 394#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 395#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 404#L18-1 [2024-11-19 14:16:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-11-19 14:16:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954381204] [2024-11-19 14:16:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954381204] [2024-11-19 14:16:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954381204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:16:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418702068] [2024-11-19 14:16:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:12,802 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:12,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 2 times [2024-11-19 14:16:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408070414] [2024-11-19 14:16:12,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:12,809 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:16:12,809 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:12,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:12,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:12,843 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:12,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:12,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:12,844 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:12,844 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:12,844 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,844 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:12,844 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:12,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-11-19 14:16:12,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:12,845 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:12,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:12,883 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-11-19 14:16:12,896 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-11-19 14:16:12,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,920 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:12,920 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:12,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,922 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:16:12,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,945 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:12,946 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:12,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,958 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:16:12,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:12,971 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:12,971 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:12,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:12,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:12,984 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:12,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:16:12,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:12,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:13,008 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-11-19 14:16:13,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,009 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:16:13,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:13,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:13,023 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:13,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:13,034 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:13,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:13,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:13,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:13,034 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:13,035 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,035 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:13,035 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:13,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-11-19 14:16:13,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:13,035 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:13,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,100 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:13,100 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:13,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,102 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:16:13,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:13,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:13,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:13,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:13,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:13,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:13,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:13,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:13,137 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-11-19 14:16:13,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,140 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:16:13,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:13,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:13,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:13,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:13,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:13,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:13,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:13,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:13,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:13,162 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:13,162 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,164 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:16:13,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:13,166 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:13,166 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:13,166 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-19 14:16:13,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:16:13,181 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,237 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:13,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 94 transitions. cyclomatic complexity: 44 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 94 transitions. cyclomatic complexity: 44. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 116 states and 190 transitions. Complement of second has 7 states. [2024-11-19 14:16:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-19 14:16:13,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:16:13,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:16:13,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-19 14:16:13,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 190 transitions. [2024-11-19 14:16:13,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-19 14:16:13,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 107 states and 175 transitions. [2024-11-19 14:16:13,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-19 14:16:13,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-11-19 14:16:13,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 175 transitions. [2024-11-19 14:16:13,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 175 transitions. [2024-11-19 14:16:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 175 transitions. [2024-11-19 14:16:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2024-11-19 14:16:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.6770833333333333) internal successors, (161), 95 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2024-11-19 14:16:13,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 161 transitions. [2024-11-19 14:16:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:16:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:16:13,290 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:13,303 INFO L93 Difference]: Finished difference Result 107 states and 163 transitions. [2024-11-19 14:16:13,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 163 transitions. [2024-11-19 14:16:13,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2024-11-19 14:16:13,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 153 transitions. [2024-11-19 14:16:13,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-19 14:16:13,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-19 14:16:13,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 153 transitions. [2024-11-19 14:16:13,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-19 14:16:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 153 transitions. [2024-11-19 14:16:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-19 14:16:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 95 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-11-19 14:16:13,314 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-19 14:16:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:16:13,315 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-19 14:16:13,316 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:16:13,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 148 transitions. [2024-11-19 14:16:13,317 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-19 14:16:13,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:13,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:13,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2024-11-19 14:16:13,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:13,318 INFO L745 eck$LassoCheckResult]: Stem: 806#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 807#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 801#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 803#L12 assume !(10 == main_~i~0#1); 809#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 863#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 858#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 854#L12 assume !(10 == main_~i~0#1); 848#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 846#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 817#L18-1 [2024-11-19 14:16:13,318 INFO L747 eck$LassoCheckResult]: Loop: 817#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 839#L12 assume !(10 == main_~i~0#1); 818#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 816#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 817#L18-1 [2024-11-19 14:16:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1506873443, now seen corresponding path program 1 times [2024-11-19 14:16:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229486517] [2024-11-19 14:16:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229486517] [2024-11-19 14:16:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229486517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:16:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798431081] [2024-11-19 14:16:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:13,346 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 3 times [2024-11-19 14:16:13,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756019676] [2024-11-19 14:16:13,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:16:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,350 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:16:13,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:13,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:13,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:13,382 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:13,382 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:13,382 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:13,382 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:13,382 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:13,382 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,382 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:13,382 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:13,382 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-11-19 14:16:13,382 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:13,382 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:13,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,431 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:13,431 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:13,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:16:13,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:13,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:13,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:16:13,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,467 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:16:13,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:13,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:13,484 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:13,499 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-11-19 14:16:13,499 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:13,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:13,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:13,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:13,499 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:13,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:13,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:13,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-11-19 14:16:13,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:13,500 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:13,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:13,546 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:13,546 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,547 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:16:13,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:13,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:13,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:13,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:13,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:13,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:13,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:13,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:13,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-19 14:16:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,580 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:16:13,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:13,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:13,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:13,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:13,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:13,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:13,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:13,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:13,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:13,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:13,603 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,605 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:16:13,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:13,607 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:13,607 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:13,607 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2024-11-19 14:16:13,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:13,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,686 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:13,687 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 147 states and 221 transitions. Complement of second has 7 states. [2024-11-19 14:16:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-19 14:16:13,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:16:13,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,715 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:13,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,764 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:13,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 147 states and 221 transitions. Complement of second has 7 states. [2024-11-19 14:16:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-19 14:16:13,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:16:13,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,789 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:13,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,848 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:13,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 148 transitions. cyclomatic complexity: 61. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 161 states and 250 transitions. Complement of second has 6 states. [2024-11-19 14:16:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-19 14:16:13,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:16:13,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:16:13,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-19 14:16:13,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:13,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 250 transitions. [2024-11-19 14:16:13,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2024-11-19 14:16:13,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 119 states and 180 transitions. [2024-11-19 14:16:13,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-19 14:16:13,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-19 14:16:13,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 180 transitions. [2024-11-19 14:16:13,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-19 14:16:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 180 transitions. [2024-11-19 14:16:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2024-11-19 14:16:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 76 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-19 14:16:13,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-19 14:16:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:13,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:16:13,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:16:13,892 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:13,905 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-11-19 14:16:13,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2024-11-19 14:16:13,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-19 14:16:13,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 68 transitions. [2024-11-19 14:16:13,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:16:13,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:16:13,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 68 transitions. [2024-11-19 14:16:13,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:13,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-19 14:16:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 68 transitions. [2024-11-19 14:16:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-19 14:16:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-11-19 14:16:13,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-19 14:16:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:16:13,914 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-19 14:16:13,914 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:16:13,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2024-11-19 14:16:13,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-19 14:16:13,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:13,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:13,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:16:13,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:13,915 INFO L745 eck$LassoCheckResult]: Stem: 1655#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1656#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1659#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1679#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 1669#L12-2 assume !(0 == main_~i~0#1); 1657#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1658#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1677#L12 assume !(10 == main_~i~0#1); 1676#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1646#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1672#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1670#L12 [2024-11-19 14:16:13,915 INFO L747 eck$LassoCheckResult]: Loop: 1670#L12 assume !(10 == main_~i~0#1); 1668#L12-2 assume !(0 == main_~i~0#1); 1665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1666#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1670#L12 [2024-11-19 14:16:13,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1179049836, now seen corresponding path program 1 times [2024-11-19 14:16:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305938264] [2024-11-19 14:16:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305938264] [2024-11-19 14:16:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305938264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76602652] [2024-11-19 14:16:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:13,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:13,967 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:16:13,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-19 14:16:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:13,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:16:13,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76602652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:14,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:14,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 14:16:14,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997065989] [2024-11-19 14:16:14,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:14,026 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 2 times [2024-11-19 14:16:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665070535] [2024-11-19 14:16:14,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:14,031 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:16:14,031 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:14,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:14,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:14,080 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,080 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:14,080 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,080 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-11-19 14:16:14,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,159 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,160 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:14,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,162 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:16:14,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,195 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-11-19 14:16:14,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,198 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:16:14,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:14,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,284 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:14,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:16:14,290 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,291 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:14,291 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,291 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,291 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-11-19 14:16:14,291 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,291 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,378 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,379 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,381 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:14,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:16:14,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:14,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:14,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:14,396 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:16:14,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:14,397 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:16:14,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:14,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:14,403 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:14,403 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:16:14,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,406 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:16:14,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:14,407 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:14,407 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:14,407 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2024-11-19 14:16:14,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,423 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,478 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:14,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 90 transitions. Complement of second has 7 states. [2024-11-19 14:16:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:16:14,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-19 14:16:14,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,503 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,549 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:14,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 90 transitions. Complement of second has 7 states. [2024-11-19 14:16:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-19 14:16:14,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-19 14:16:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,570 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:14,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:14,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:14,620 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:14,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,658 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 65 transitions. cyclomatic complexity: 22. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 86 states and 124 transitions. Complement of second has 6 states. [2024-11-19 14:16:14,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 14:16:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:14,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-19 14:16:14,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-19 14:16:14,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 8 letters. [2024-11-19 14:16:14,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:14,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 124 transitions. [2024-11-19 14:16:14,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-19 14:16:14,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 56 states and 76 transitions. [2024-11-19 14:16:14,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:16:14,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-19 14:16:14,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2024-11-19 14:16:14,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:14,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-19 14:16:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2024-11-19 14:16:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-11-19 14:16:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 41 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-19 14:16:14,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-19 14:16:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:16:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:16:14,666 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:14,715 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-11-19 14:16:14,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2024-11-19 14:16:14,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-19 14:16:14,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 72 states and 93 transitions. [2024-11-19 14:16:14,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:16:14,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-19 14:16:14,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2024-11-19 14:16:14,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:14,717 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-11-19 14:16:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2024-11-19 14:16:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-11-19 14:16:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-11-19 14:16:14,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-19 14:16:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:16:14,720 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-19 14:16:14,720 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:16:14,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 85 transitions. [2024-11-19 14:16:14,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-19 14:16:14,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:14,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:14,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:16:14,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:14,722 INFO L745 eck$LassoCheckResult]: Stem: 2280#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2281#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 2285#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2292#L12 assume !(10 == main_~i~0#1); 2272#L12-2 assume !(0 == main_~i~0#1); 2273#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2305#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2286#L12 assume !(10 == main_~i~0#1); 2287#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2330#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2332#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2303#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2302#L12-2 [2024-11-19 14:16:14,722 INFO L747 eck$LassoCheckResult]: Loop: 2302#L12-2 assume !(0 == main_~i~0#1); 2337#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2336#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2301#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2302#L12-2 [2024-11-19 14:16:14,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 2 times [2024-11-19 14:16:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:14,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532579579] [2024-11-19 14:16:14,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:14,727 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:14,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 14:16:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532579579] [2024-11-19 14:16:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532579579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:16:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906871863] [2024-11-19 14:16:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:14,763 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-11-19 14:16:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177985321] [2024-11-19 14:16:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:14,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:14,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:14,798 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,798 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,798 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:14,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-11-19 14:16:14,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,799 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,857 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:14,857 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:14,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,858 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:16:14,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,878 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:14,879 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:14,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 14:16:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,890 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:16:14,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,908 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:14,908 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:14,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,920 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:16:14,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:14,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,946 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-11-19 14:16:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:14,947 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:14,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:16:14,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:14,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:14,960 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:14,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:14,975 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:14,975 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:14,975 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:14,975 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:14,975 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:14,975 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:14,975 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:14,975 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:14,975 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-11-19 14:16:14,975 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:14,975 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:14,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:14,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,037 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:15,037 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,039 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:16:15,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:15,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,050 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:16:15,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,051 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 14:16:15,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:15,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:15,068 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-11-19 14:16:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,070 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:16:15,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:15,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:15,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:15,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:15,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,103 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:16:15,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:15,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:15,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:15,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:15,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,142 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:16:15,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:15,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:15,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:15,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:15,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:15,162 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:15,162 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:15,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,164 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-19 14:16:15,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:15,168 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:15,169 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:15,169 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:15,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-19 14:16:15,183 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:15,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:15,232 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:15,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 85 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,252 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 85 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 160 states and 209 transitions. Complement of second has 7 states. [2024-11-19 14:16:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:15,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-19 14:16:15,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-11-19 14:16:15,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-11-19 14:16:15,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 209 transitions. [2024-11-19 14:16:15,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-19 14:16:15,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 126 states and 161 transitions. [2024-11-19 14:16:15,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-19 14:16:15,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-19 14:16:15,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 161 transitions. [2024-11-19 14:16:15,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:15,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-11-19 14:16:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 161 transitions. [2024-11-19 14:16:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-11-19 14:16:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 119 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2024-11-19 14:16:15,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2024-11-19 14:16:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:16:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:16:15,261 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:15,281 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2024-11-19 14:16:15,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 174 transitions. [2024-11-19 14:16:15,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-19 14:16:15,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 174 transitions. [2024-11-19 14:16:15,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-19 14:16:15,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-19 14:16:15,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 174 transitions. [2024-11-19 14:16:15,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:15,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 174 transitions. [2024-11-19 14:16:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 174 transitions. [2024-11-19 14:16:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-19 14:16:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 116 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2024-11-19 14:16:15,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-19 14:16:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:16:15,292 INFO L425 stractBuchiCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-19 14:16:15,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:16:15,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 147 transitions. [2024-11-19 14:16:15,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-19 14:16:15,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:15,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:15,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2024-11-19 14:16:15,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:16:15,294 INFO L745 eck$LassoCheckResult]: Stem: 2835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 2840#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2848#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2827#L12-2 assume !(0 == main_~i~0#1); 2828#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2942#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2843#L12 assume !(10 == main_~i~0#1); 2829#L12-2 assume !(0 == main_~i~0#1); 2830#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2839#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2941#L12 assume !(10 == main_~i~0#1); 2940#L12-2 assume !(0 == main_~i~0#1); 2939#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2937#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2936#L12 assume !(10 == main_~i~0#1); 2935#L12-2 assume !(0 == main_~i~0#1); 2933#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2934#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2938#L12 assume !(10 == main_~i~0#1); 2842#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2902#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2900#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2899#L12 assume !(10 == main_~i~0#1); 2877#L12-2 assume !(0 == main_~i~0#1); 2879#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2878#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2876#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2850#L12-2 [2024-11-19 14:16:15,294 INFO L747 eck$LassoCheckResult]: Loop: 2850#L12-2 assume !(0 == main_~i~0#1); 2845#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 2846#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 2874#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 2850#L12-2 [2024-11-19 14:16:15,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 3 times [2024-11-19 14:16:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822248607] [2024-11-19 14:16:15,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:16:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:15,301 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:16:15,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:16:15,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822248607] [2024-11-19 14:16:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822248607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802795694] [2024-11-19 14:16:15,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:16:15,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:15,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,342 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-19 14:16:15,368 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:16:15,368 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:15,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:16:15,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 14:16:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802795694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:15,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 14:16:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572709448] [2024-11-19 14:16:15,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:15,418 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:16:15,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-11-19 14:16:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116676187] [2024-11-19 14:16:15,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:15,424 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:16:15,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:15,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:15,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:15,458 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:15,459 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:15,459 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:15,459 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:15,459 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:15,459 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,459 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:15,459 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:15,459 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-11-19 14:16:15,459 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:15,459 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:15,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,525 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:15,525 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,527 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-19 14:16:15,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:15,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:15,553 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:16:15,553 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:16:15,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,569 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-19 14:16:15,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:15,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:15,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,602 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-19 14:16:15,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:15,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:15,621 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:15,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,636 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:15,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:15,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:15,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:15,637 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:15,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:15,637 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:15,637 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-11-19 14:16:15,637 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:15,637 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:15,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:15,703 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:15,705 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,707 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-19 14:16:15,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:15,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:16:15,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:16:15,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:16:15,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:15,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,743 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-19 14:16:15,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:15,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:15,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:15,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:15,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:15,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:15,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:15,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:15,758 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:15,760 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:15,760 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:15,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:15,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:15,762 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:15,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-19 14:16:15,764 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:15,764 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:15,764 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:15,764 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:15,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-19 14:16:15,775 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:15,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:15,852 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:15,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 164 states and 204 transitions. Complement of second has 7 states. [2024-11-19 14:16:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:16:15,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-19 14:16:15,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,872 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:15,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:15,939 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:15,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 198 states and 239 transitions. Complement of second has 7 states. [2024-11-19 14:16:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-19 14:16:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-19 14:16:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:15,967 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:15,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:15,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:16,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:16:16,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:16:16,041 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:16:16,041 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 147 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 176 states and 219 transitions. Complement of second has 8 states. [2024-11-19 14:16:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-19 14:16:16,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-19 14:16:16,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-19 14:16:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2024-11-19 14:16:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:16,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 219 transitions. [2024-11-19 14:16:16,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-19 14:16:16,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 121 states and 151 transitions. [2024-11-19 14:16:16,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:16:16,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-19 14:16:16,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 151 transitions. [2024-11-19 14:16:16,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:16,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 151 transitions. [2024-11-19 14:16:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 151 transitions. [2024-11-19 14:16:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2024-11-19 14:16:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.25) internal successors, (95), 75 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-19 14:16:16,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-19 14:16:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:16,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:16:16,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:16:16,073 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:16,116 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2024-11-19 14:16:16,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 161 transitions. [2024-11-19 14:16:16,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2024-11-19 14:16:16,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 132 states and 161 transitions. [2024-11-19 14:16:16,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:16:16,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:16:16,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 161 transitions. [2024-11-19 14:16:16,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:16,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 161 transitions. [2024-11-19 14:16:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 161 transitions. [2024-11-19 14:16:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2024-11-19 14:16:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 91 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2024-11-19 14:16:16,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-11-19 14:16:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:16:16,121 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-11-19 14:16:16,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:16:16,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 111 transitions. [2024-11-19 14:16:16,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2024-11-19 14:16:16,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:16,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:16,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-19 14:16:16,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 6, 4, 1, 1] [2024-11-19 14:16:16,123 INFO L745 eck$LassoCheckResult]: Stem: 4192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4187#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(10 == main_~i~0#1); 4212#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4202#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 [2024-11-19 14:16:16,123 INFO L747 eck$LassoCheckResult]: Loop: 4204#L12 assume !(10 == main_~i~0#1); 4241#L12-2 assume !(0 == main_~i~0#1); 4240#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4238#L12 assume !(10 == main_~i~0#1); 4237#L12-2 assume !(0 == main_~i~0#1); 4236#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4235#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4234#L12 assume !(10 == main_~i~0#1); 4233#L12-2 assume !(0 == main_~i~0#1); 4232#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4231#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4230#L12 assume !(10 == main_~i~0#1); 4229#L12-2 assume !(0 == main_~i~0#1); 4228#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4227#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4226#L12 assume !(10 == main_~i~0#1); 4206#L12-2 assume !(0 == main_~i~0#1); 4209#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4208#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4205#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4207#L12-2 assume !(0 == main_~i~0#1); 4263#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4262#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4261#L12 assume !(10 == main_~i~0#1); 4260#L12-2 assume !(0 == main_~i~0#1); 4259#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4258#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4257#L12 assume !(10 == main_~i~0#1); 4256#L12-2 assume !(0 == main_~i~0#1); 4255#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4254#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4252#L12 assume !(10 == main_~i~0#1); 4251#L12-2 assume !(0 == main_~i~0#1); 4249#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4250#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(10 == main_~i~0#1); 4212#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4202#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 [2024-11-19 14:16:16,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 2 times [2024-11-19 14:16:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061045890] [2024-11-19 14:16:16,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,127 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:16,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:16,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:16,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1215501985, now seen corresponding path program 1 times [2024-11-19 14:16:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685197174] [2024-11-19 14:16:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:16,195 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-11-19 14:16:16,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-19 14:16:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 14:16:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685197174] [2024-11-19 14:16:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685197174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89977128] [2024-11-19 14:16:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:16,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:16,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:16,276 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:16:16,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-11-19 14:16:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:16,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:16:16,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 14:16:16,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 14:16:16,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89977128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:16,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 14:16:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340951180] [2024-11-19 14:16:16,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:16,403 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:16:16,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:16:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:16:16,404 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. cyclomatic complexity: 23 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:16,470 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2024-11-19 14:16:16,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 249 transitions. [2024-11-19 14:16:16,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2024-11-19 14:16:16,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 173 states and 213 transitions. [2024-11-19 14:16:16,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-19 14:16:16,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-19 14:16:16,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 213 transitions. [2024-11-19 14:16:16,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:16,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-11-19 14:16:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 213 transitions. [2024-11-19 14:16:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-11-19 14:16:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.225609756097561) internal successors, (201), 163 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2024-11-19 14:16:16,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-11-19 14:16:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:16:16,476 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-11-19 14:16:16,476 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:16:16,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 201 transitions. [2024-11-19 14:16:16,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2024-11-19 14:16:16,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:16,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:16,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-19 14:16:16,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2024-11-19 14:16:16,478 INFO L745 eck$LassoCheckResult]: Stem: 4736#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4731#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4733#L12 assume !(10 == main_~i~0#1); 4774#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4770#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4767#L12 [2024-11-19 14:16:16,478 INFO L747 eck$LassoCheckResult]: Loop: 4767#L12 assume !(10 == main_~i~0#1); 4765#L12-2 assume !(0 == main_~i~0#1); 4764#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4763#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4762#L12 assume !(10 == main_~i~0#1); 4761#L12-2 assume !(0 == main_~i~0#1); 4760#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4759#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4758#L12 assume !(10 == main_~i~0#1); 4757#L12-2 assume !(0 == main_~i~0#1); 4756#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4755#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4754#L12 assume !(10 == main_~i~0#1); 4753#L12-2 assume !(0 == main_~i~0#1); 4752#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4751#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4750#L12 assume !(10 == main_~i~0#1); 4747#L12-2 assume !(0 == main_~i~0#1); 4749#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4748#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4746#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4728#L12-2 assume !(0 == main_~i~0#1); 4729#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4734#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4735#L12 assume !(10 == main_~i~0#1); 4742#L12-2 assume !(0 == main_~i~0#1); 4891#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4890#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4889#L12 assume !(10 == main_~i~0#1); 4888#L12-2 assume !(0 == main_~i~0#1); 4887#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4886#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4885#L12 assume !(10 == main_~i~0#1); 4884#L12-2 assume !(0 == main_~i~0#1); 4883#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4881#L12 assume !(10 == main_~i~0#1); 4880#L12-2 assume !(0 == main_~i~0#1); 4879#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4878#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4877#L12 assume !(10 == main_~i~0#1); 4876#L12-2 assume !(0 == main_~i~0#1); 4875#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4874#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4873#L12 assume !(10 == main_~i~0#1); 4872#L12-2 assume !(0 == main_~i~0#1); 4871#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4870#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4869#L12 assume !(10 == main_~i~0#1); 4868#L12-2 assume !(0 == main_~i~0#1); 4867#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4866#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4865#L12 assume !(10 == main_~i~0#1); 4864#L12-2 assume !(0 == main_~i~0#1); 4863#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4862#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4782#L12 assume !(10 == main_~i~0#1); 4861#L12-2 assume !(0 == main_~i~0#1); 4826#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4781#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4733#L12 assume !(10 == main_~i~0#1); 4774#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4770#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4767#L12 [2024-11-19 14:16:16,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 3 times [2024-11-19 14:16:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118797667] [2024-11-19 14:16:16,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:16:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,482 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:16:16,482 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:16,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:16,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,485 INFO L85 PathProgramCache]: Analyzing trace with hash 726843037, now seen corresponding path program 2 times [2024-11-19 14:16:16,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817115931] [2024-11-19 14:16:16,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:16:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,495 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:16:16,496 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:16,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:16,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1110135673, now seen corresponding path program 4 times [2024-11-19 14:16:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054036555] [2024-11-19 14:16:16,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:16:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:16,519 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:16:16,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-19 14:16:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054036555] [2024-11-19 14:16:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054036555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:16:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546699] [2024-11-19 14:16:16,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:16:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:16:16,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:16,673 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:16:16,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-11-19 14:16:16,711 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:16:16,712 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:16,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:16:16,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-19 14:16:16,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:16:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-19 14:16:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:16:16,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:16:16,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-19 14:16:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474779541] [2024-11-19 14:16:16,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:16:17,129 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:17,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:17,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:17,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:17,129 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:16:17,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:17,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:17,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:17,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-11-19 14:16:17,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:17,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:17,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,185 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:17,186 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:16:17,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:17,188 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:17,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-19 14:16:17,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:16:17,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:17,225 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-11-19 14:16:17,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:17,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:17,227 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:17,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-19 14:16:17,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:16:17,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:16:17,242 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:16:17,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-19 14:16:17,253 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:16:17,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:16:17,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:16:17,253 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:16:17,253 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:16:17,253 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:17,253 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:16:17,253 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:16:17,253 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-11-19 14:16:17,253 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:16:17,253 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:16:17,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:16:17,294 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:16:17,294 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:16:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:17,295 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:17,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-19 14:16:17,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:16:17,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:16:17,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:16:17,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:16:17,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:16:17,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:16:17,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:16:17,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:16:17,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:16:17,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:16:17,310 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:16:17,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:16:17,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:16:17,312 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:16:17,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-19 14:16:17,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:16:17,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:16:17,314 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:16:17,314 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:16:17,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-19 14:16:17,325 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:16:17,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:17,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:17,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:17,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:16:17,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 14:16:17,511 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-19 14:16:17,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:17,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 489 states and 580 transitions. Complement of second has 17 states. [2024-11-19 14:16:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2024-11-19 14:16:17,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-19 14:16:17,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:17,610 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:17,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:17,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:17,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:17,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:16:17,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:17,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-11-19 14:16:17,792 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-19 14:16:17,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 784 states and 937 transitions. Complement of second has 31 states. [2024-11-19 14:16:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2024-11-19 14:16:18,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-19 14:16:18,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:18,055 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:18,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:18,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:18,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:18,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:16:18,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 14:16:18,238 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-19 14:16:18,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1329 states and 1557 transitions. Complement of second has 174 states. [2024-11-19 14:16:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-19 14:16:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2024-11-19 14:16:18,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 76 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-19 14:16:18,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:18,477 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:16:18,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:18,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:16:18,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:16:18,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:16:18,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:16:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 260 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 14:16:18,638 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-11-19 14:16:18,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 201 transitions. cyclomatic complexity: 41. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1639 states and 1887 transitions. Complement of second has 195 states. [2024-11-19 14:16:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2024-11-19 14:16:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2024-11-19 14:16:18,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-19 14:16:18,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:18,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 71 letters. Loop has 64 letters. [2024-11-19 14:16:18,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:18,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 128 letters. [2024-11-19 14:16:18,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:16:18,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1639 states and 1887 transitions. [2024-11-19 14:16:18,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-11-19 14:16:18,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1639 states to 522 states and 614 transitions. [2024-11-19 14:16:18,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:16:18,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2024-11-19 14:16:18,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 614 transitions. [2024-11-19 14:16:18,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:18,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 614 transitions. [2024-11-19 14:16:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 614 transitions. [2024-11-19 14:16:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 163. [2024-11-19 14:16:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 1.2085889570552146) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-11-19 14:16:18,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-11-19 14:16:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:16:18,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:16:18,910 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:18,961 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2024-11-19 14:16:18,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 454 transitions. [2024-11-19 14:16:18,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 195 [2024-11-19 14:16:18,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 298 states and 353 transitions. [2024-11-19 14:16:18,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-11-19 14:16:18,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-11-19 14:16:18,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 353 transitions. [2024-11-19 14:16:18,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:18,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 353 transitions. [2024-11-19 14:16:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 353 transitions. [2024-11-19 14:16:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 152. [2024-11-19 14:16:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 151 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2024-11-19 14:16:18,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-19 14:16:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:16:18,970 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-19 14:16:18,970 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:16:18,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 183 transitions. [2024-11-19 14:16:18,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2024-11-19 14:16:18,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:18,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:18,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-19 14:16:18,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 20, 19, 11, 10, 2, 1] [2024-11-19 14:16:18,972 INFO L745 eck$LassoCheckResult]: Stem: 11506#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 11511#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11521#L12 assume !(10 == main_~i~0#1); 11524#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11522#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11515#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11517#L12 [2024-11-19 14:16:18,972 INFO L747 eck$LassoCheckResult]: Loop: 11517#L12 assume !(10 == main_~i~0#1); 11604#L12-2 assume !(0 == main_~i~0#1); 11603#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11602#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11601#L12 assume !(10 == main_~i~0#1); 11600#L12-2 assume !(0 == main_~i~0#1); 11599#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11598#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11597#L12 assume !(10 == main_~i~0#1); 11596#L12-2 assume !(0 == main_~i~0#1); 11595#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11594#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11593#L12 assume !(10 == main_~i~0#1); 11590#L12-2 assume !(0 == main_~i~0#1); 11592#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11591#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11589#L12 assume !(10 == main_~i~0#1); 11498#L12-2 assume !(0 == main_~i~0#1); 11499#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11502#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11503#L12 assume !(10 == main_~i~0#1); 11588#L12-2 assume !(0 == main_~i~0#1); 11587#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11586#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11585#L12 assume !(10 == main_~i~0#1); 11584#L12-2 assume !(0 == main_~i~0#1); 11583#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11582#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11581#L12 assume !(10 == main_~i~0#1); 11580#L12-2 assume !(0 == main_~i~0#1); 11579#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11578#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11577#L12 assume !(10 == main_~i~0#1); 11576#L12-2 assume !(0 == main_~i~0#1); 11575#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11574#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11573#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11572#L12-2 assume !(0 == main_~i~0#1); 11571#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11570#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11569#L12 assume !(10 == main_~i~0#1); 11568#L12-2 assume !(0 == main_~i~0#1); 11567#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11566#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11565#L12 assume !(10 == main_~i~0#1); 11564#L12-2 assume !(0 == main_~i~0#1); 11563#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11562#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11561#L12 assume !(10 == main_~i~0#1); 11560#L12-2 assume !(0 == main_~i~0#1); 11559#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11558#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11557#L12 assume !(10 == main_~i~0#1); 11556#L12-2 assume !(0 == main_~i~0#1); 11555#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11554#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11553#L12 assume !(10 == main_~i~0#1); 11552#L12-2 assume !(0 == main_~i~0#1); 11551#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11550#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11549#L12 assume !(10 == main_~i~0#1); 11548#L12-2 assume !(0 == main_~i~0#1); 11547#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11546#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11545#L12 assume !(10 == main_~i~0#1); 11544#L12-2 assume !(0 == main_~i~0#1); 11543#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11542#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11541#L12 assume !(10 == main_~i~0#1); 11540#L12-2 assume !(0 == main_~i~0#1); 11539#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11538#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11534#L12 assume !(10 == main_~i~0#1); 11536#L12-2 assume !(0 == main_~i~0#1); 11535#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11533#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11532#L12 assume !(10 == main_~i~0#1); 11530#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11531#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11607#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11516#L12 assume !(10 == main_~i~0#1); 11527#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11522#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11515#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11517#L12 [2024-11-19 14:16:18,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 4 times [2024-11-19 14:16:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042273173] [2024-11-19 14:16:18,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:16:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:18,976 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:16:18,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:18,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:18,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:18,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1840948782, now seen corresponding path program 3 times [2024-11-19 14:16:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722343789] [2024-11-19 14:16:18,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:16:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:18,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:16:18,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:16:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-19 14:16:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:16:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722343789] [2024-11-19 14:16:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722343789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:16:19,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:16:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:16:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087243252] [2024-11-19 14:16:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:16:19,001 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:16:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:16:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:16:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:16:19,002 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:16:19,020 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2024-11-19 14:16:19,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 181 transitions. [2024-11-19 14:16:19,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:16:19,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 144 states and 170 transitions. [2024-11-19 14:16:19,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:16:19,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-19 14:16:19,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. [2024-11-19 14:16:19,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:16:19,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-11-19 14:16:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. [2024-11-19 14:16:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2024-11-19 14:16:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 100 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:16:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2024-11-19 14:16:19,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-11-19 14:16:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:16:19,025 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-11-19 14:16:19,025 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:16:19,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2024-11-19 14:16:19,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-19 14:16:19,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:16:19,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:16:19,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 1, 1, 1] [2024-11-19 14:16:19,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-19 14:16:19,026 INFO L745 eck$LassoCheckResult]: Stem: 11816#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11817#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 11820#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11829#L12 assume !(10 == main_~i~0#1); 11830#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11831#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11812#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11813#L12 assume !(10 == main_~i~0#1); 11865#L12-2 assume !(0 == main_~i~0#1); 11864#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11863#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11862#L12 assume !(10 == main_~i~0#1); 11861#L12-2 assume !(0 == main_~i~0#1); 11860#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11859#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11858#L12 assume !(10 == main_~i~0#1); 11857#L12-2 assume !(0 == main_~i~0#1); 11856#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11855#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11854#L12 assume !(10 == main_~i~0#1); 11850#L12-2 assume !(0 == main_~i~0#1); 11853#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11852#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11849#L12 assume !(10 == main_~i~0#1); 11832#L12-2 [2024-11-19 14:16:19,027 INFO L747 eck$LassoCheckResult]: Loop: 11832#L12-2 assume !(0 == main_~i~0#1); 11825#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11826#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11851#L12 assume !(10 == main_~i~0#1); 11848#L12-2 assume !(0 == main_~i~0#1); 11847#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11846#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11845#L12 assume !(10 == main_~i~0#1); 11844#L12-2 assume !(0 == main_~i~0#1); 11843#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11842#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11841#L12 assume !(10 == main_~i~0#1); 11840#L12-2 assume !(0 == main_~i~0#1); 11839#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11838#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11837#L12 assume !(10 == main_~i~0#1); 11836#L12-2 assume !(0 == main_~i~0#1); 11835#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11834#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11833#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11809#L12-2 assume !(0 == main_~i~0#1); 11810#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11814#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11815#L12 assume !(10 == main_~i~0#1); 11907#L12-2 assume !(0 == main_~i~0#1); 11906#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11905#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11904#L12 assume !(10 == main_~i~0#1); 11903#L12-2 assume !(0 == main_~i~0#1); 11902#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11901#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11900#L12 assume !(10 == main_~i~0#1); 11899#L12-2 assume !(0 == main_~i~0#1); 11898#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11897#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11896#L12 assume !(10 == main_~i~0#1); 11895#L12-2 assume !(0 == main_~i~0#1); 11894#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11893#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11892#L12 assume !(10 == main_~i~0#1); 11891#L12-2 assume !(0 == main_~i~0#1); 11890#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11889#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11888#L12 assume !(10 == main_~i~0#1); 11887#L12-2 assume !(0 == main_~i~0#1); 11886#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11885#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11884#L12 assume !(10 == main_~i~0#1); 11883#L12-2 assume !(0 == main_~i~0#1); 11882#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11881#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11880#L12 assume !(10 == main_~i~0#1); 11879#L12-2 assume !(0 == main_~i~0#1); 11878#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11877#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11874#L12 assume !(10 == main_~i~0#1); 11876#L12-2 assume !(0 == main_~i~0#1); 11875#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11873#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11872#L12 assume !(10 == main_~i~0#1); 11822#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11871#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11869#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11866#L12 assume !(10 == main_~i~0#1); 11865#L12-2 assume !(0 == main_~i~0#1); 11864#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11863#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11862#L12 assume !(10 == main_~i~0#1); 11861#L12-2 assume !(0 == main_~i~0#1); 11860#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11859#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11858#L12 assume !(10 == main_~i~0#1); 11857#L12-2 assume !(0 == main_~i~0#1); 11856#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11855#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11854#L12 assume !(10 == main_~i~0#1); 11850#L12-2 assume !(0 == main_~i~0#1); 11853#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11852#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11849#L12 assume !(10 == main_~i~0#1); 11832#L12-2 [2024-11-19 14:16:19,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash 781927031, now seen corresponding path program 1 times [2024-11-19 14:16:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:19,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588520136] [2024-11-19 14:16:19,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:16:19,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:19,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:19,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 921517193, now seen corresponding path program 4 times [2024-11-19 14:16:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451269903] [2024-11-19 14:16:19,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:16:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:19,043 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:16:19,044 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:19,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:19,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:19,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:16:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash 933372671, now seen corresponding path program 5 times [2024-11-19 14:16:19,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:16:19,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420351399] [2024-11-19 14:16:19,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:16:19,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:16:19,070 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2024-11-19 14:16:19,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:16:19,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:19,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:16:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:19,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:16:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:16:19,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:16:19 BoogieIcfgContainer [2024-11-19 14:16:19,704 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:16:19,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:16:19,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:16:19,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:16:19,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:16:10" (3/4) ... [2024-11-19 14:16:19,712 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:16:19,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:16:19,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:16:19,763 INFO L158 Benchmark]: Toolchain (without parser) took 10009.39ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 98.8MB in the beginning and 109.7MB in the end (delta: -10.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-19 14:16:19,765 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 153.1MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:16:19,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.27ms. Allocated memory is still 153.1MB. Free memory was 98.4MB in the beginning and 87.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 14:16:19,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.94ms. Allocated memory is still 153.1MB. Free memory was 86.6MB in the beginning and 85.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:16:19,766 INFO L158 Benchmark]: Boogie Preprocessor took 22.14ms. Allocated memory is still 153.1MB. Free memory was 85.4MB in the beginning and 84.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:16:19,766 INFO L158 Benchmark]: RCFGBuilder took 221.96ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 74.9MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:16:19,766 INFO L158 Benchmark]: BuchiAutomizer took 9460.89ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 74.9MB in the beginning and 112.8MB in the end (delta: -38.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-19 14:16:19,766 INFO L158 Benchmark]: Witness Printer took 52.99ms. Allocated memory is still 199.2MB. Free memory was 112.8MB in the beginning and 109.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:16:19,768 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.56ms. Allocated memory is still 153.1MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.27ms. Allocated memory is still 153.1MB. Free memory was 98.4MB in the beginning and 87.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.94ms. Allocated memory is still 153.1MB. Free memory was 86.6MB in the beginning and 85.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.14ms. Allocated memory is still 153.1MB. Free memory was 85.4MB in the beginning and 84.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.96ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 74.9MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9460.89ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 74.9MB in the beginning and 112.8MB in the end (delta: -38.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Witness Printer took 52.99ms. Allocated memory is still 199.2MB. Free memory was 112.8MB in the beginning and 109.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (9 trivial, 5 deterministic, 4 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 5 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 16 locations. 9 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 101 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 12 iterations. TraceHistogramMax:21. Analysis of lassos took 5.8s. 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, 757 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 220/480 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 863 IncrementalHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 201 mSDtfsCounter, 863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax182 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf91 smp94 dnf122 smp94 tf111 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 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-11-19 14:16:19,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2024-11-19 14:16:19,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2024-11-19 14:16:20,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2024-11-19 14:16:20,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-19 14:16:20,593 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)