./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1a3ce217426a55eb46107f2cdf23c10dcc5d92a99768880786a980fae67c3971 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:11:44,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:11:44,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-20 22:11:44,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:11:44,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:11:44,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:11:44,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:11:44,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:11:44,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:11:44,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:11:44,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:11:44,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:11:44,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:11:44,153 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:11:44,153 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:11:44,153 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:11:44,153 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:11:44,154 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:11:44,154 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:11:44,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:11:44,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:11:44,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:11:44,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:11:44,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:11:44,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:11:44,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:11:44,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:11:44,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:11:44,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:11:44,158 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:11:44,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:11:44,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:11:44,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:11:44,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:11:44,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:11:44,159 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:11:44,159 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-20 22:11:44,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:11:44,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:11:44,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:11:44,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:11:44,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:11:44,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-11-20 22:11:45,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:11:45,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:11:45,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2024-11-20 22:11:45,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f196ca0e/3c761d757f3949949b7fee7ae599fd8a/FLAG6f787d3bb [2024-11-20 22:11:46,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f196ca0e/3c761d757f3949949b7fee7ae599fd8a [2024-11-20 22:11:46,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:11:46,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:11:46,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:11:46,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:11:46,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:11:46,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61359960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46, skipping insertion in model container [2024-11-20 22:11:46,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:11:46,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:11:46,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:11:46,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:11:46,489 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:11:46,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46 WrapperNode [2024-11-20 22:11:46,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:11:46,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:11:46,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:11:46,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:11:46,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,509 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-20 22:11:46,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:11:46,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:11:46,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:11:46,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:11:46,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,522 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 22:11:46,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:11:46,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:11:46,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:11:46,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:11:46,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (1/1) ... [2024-11-20 22:11:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:46,565 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-20 22:11:46,569 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-20 22:11:46,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:11:46,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:11:46,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:11:46,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:11:46,716 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-20 22:11:46,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:11:46,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:11:46,726 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 22:11:46,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:11:46 BoogieIcfgContainer [2024-11-20 22:11:46,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:11:46,727 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:11:46,727 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:11:46,730 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:11:46,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:11:46,730 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:11:46" (1/3) ... [2024-11-20 22:11:46,731 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@388f0137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:11:46, skipping insertion in model container [2024-11-20 22:11:46,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:11:46,731 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:11:46" (2/3) ... [2024-11-20 22:11:46,732 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@388f0137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:11:46, skipping insertion in model container [2024-11-20 22:11:46,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:11:46,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:11:46" (3/3) ... [2024-11-20 22:11:46,733 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2024-11-20 22:11:46,784 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:11:46,784 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:11:46,784 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:11:46,784 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:11:46,785 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:11:46,785 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:11:46,785 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:11:46,785 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:11:46,791 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-20 22:11:46,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:11:46,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:46,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:46,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:11:46,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:46,807 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:11:46,807 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-20 22:11:46,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:11:46,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:46,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:46,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-20 22:11:46,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:46,814 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-20 22:11:46,814 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-20 22:11:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-20 22:11:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451671201] [2024-11-20 22:11:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:46,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:46,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:46,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-11-20 22:11:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022152552] [2024-11-20 22:11:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:46,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:46,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:46,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2024-11-20 22:11:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:46,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418596219] [2024-11-20 22:11:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:46,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:46,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:47,077 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:47,078 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:47,078 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:47,078 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:47,078 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:47,078 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,078 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:47,078 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:47,078 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-11-20 22:11:47,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:47,079 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:47,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,161 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:47,161 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:47,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,168 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-20 22:11:47,173 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-20 22:11:47,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:47,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,194 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:47,195 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-20 22:11:47,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-20 22:11:47,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,211 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-20 22:11:47,214 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-20 22:11:47,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:47,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,236 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:47,236 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-20 22:11:47,243 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-20 22:11:47,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,248 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-20 22:11:47,252 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-20 22:11:47,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:47,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,274 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:47,274 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-20 22:11:47,281 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-20 22:11:47,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,288 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-20 22:11:47,289 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-20 22:11:47,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:47,290 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:47,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,313 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-20 22:11:47,316 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-20 22:11:47,318 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:47,318 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,333 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:47,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:11:47,340 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:47,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:47,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:47,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:47,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:47,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:47,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:47,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration1_Loop [2024-11-20 22:11:47,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:47,341 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:47,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,428 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:47,432 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,438 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-20 22:11:47,439 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-20 22:11:47,440 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-20 22:11:47,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:47,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:47,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:47,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:47,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:47,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:47,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:47,471 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-20 22:11:47,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,475 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-20 22:11:47,476 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-20 22:11:47,477 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-20 22:11:47,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:47,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:47,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:47,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:47,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:47,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:47,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:47,502 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-20 22:11:47,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,505 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-20 22:11:47,510 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-20 22:11:47,511 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-20 22:11:47,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:47,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:47,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:47,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:47,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:47,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:47,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:47,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:47,528 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:47,528 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-20 22:11:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,535 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-20 22:11:47,541 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-20 22:11:47,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:47,543 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:47,543 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:47,543 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-20 22:11:47,550 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-20 22:11:47,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:47,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:47,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:47,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:47,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:47,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-20 22:11:47,641 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-20 22:11:47,642 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-20 22:11:47,689 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-20 22:11:47,691 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-20 22:11:47,695 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-20 22:11:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-11-20 22:11:47,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-20 22:11:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:47,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-20 22:11:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:47,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-20 22:11:47,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:47,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. [2024-11-20 22:11:47,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-20 22:11:47,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 30 transitions. [2024-11-20 22:11:47,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-20 22:11:47,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-20 22:11:47,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2024-11-20 22:11:47,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:47,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2024-11-20 22:11:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2024-11-20 22:11:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-20 22:11:47,723 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-20 22:11:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2024-11-20 22:11:47,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-20 22:11:47,724 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2024-11-20 22:11:47,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:11:47,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2024-11-20 22:11:47,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-20 22:11:47,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:47,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:47,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-20 22:11:47,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:47,726 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-20 22:11:47,726 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-20 22:11:47,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-11-20 22:11:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972064556] [2024-11-20 22:11:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:47,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:47,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2024-11-20 22:11:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:47,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199630206] [2024-11-20 22:11:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:47,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:47,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:47,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2024-11-20 22:11:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181206910] [2024-11-20 22:11:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:47,782 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-20 22:11:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:47,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181206910] [2024-11-20 22:11:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181206910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:11:47,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:11:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:11:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688947695] [2024-11-20 22:11:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:11:47,822 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:47,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:47,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:47,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:47,823 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:47,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:47,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:47,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-11-20 22:11:47,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:47,823 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:47,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:47,899 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:47,900 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:47,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,902 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-20 22:11:47,903 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-20 22:11:47,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:47,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,922 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:47,922 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-20 22:11:47,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:47,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,930 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-20 22:11:47,931 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-20 22:11:47,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:47,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:47,949 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-20 22:11:47,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:47,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:47,951 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-20 22:11:47,952 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-20 22:11:47,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:47,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,016 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:48,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-20 22:11:48,021 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:48,022 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:48,022 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:48,022 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:48,022 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:48,022 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,022 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:48,022 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:48,022 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2024-11-20 22:11:48,022 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:48,022 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:48,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,094 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:48,094 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:48,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,096 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-20 22:11:48,101 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-20 22:11:48,102 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-20 22:11:48,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:48,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:48,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:48,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:48,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:48,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:48,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:48,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:48,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,128 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-20 22:11:48,133 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-20 22:11:48,133 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-20 22:11:48,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:48,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:48,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:48,144 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:11:48,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:48,145 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-20 22:11:48,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:48,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:48,150 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:48,150 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-20 22:11:48,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,152 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-20 22:11:48,153 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-20 22:11:48,154 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:48,154 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:48,155 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:48,155 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-20 22:11:48,160 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-20 22:11:48,162 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:48,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:48,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:48,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:48,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:48,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:48,207 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-20 22:11:48,207 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-20 22:11:48,207 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-20 22:11:48,230 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-20 22:11:48,231 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-20 22:11:48,231 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-20 22:11:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-20 22:11:48,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-20 22:11:48,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:48,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-11-20 22:11:48,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:48,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-11-20 22:11:48,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:48,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 43 transitions. [2024-11-20 22:11:48,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-20 22:11:48,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 35 transitions. [2024-11-20 22:11:48,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:11:48,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-20 22:11:48,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 35 transitions. [2024-11-20 22:11:48,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:48,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2024-11-20 22:11:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 35 transitions. [2024-11-20 22:11:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-20 22:11:48,236 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-20 22:11:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2024-11-20 22:11:48,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 34 transitions. [2024-11-20 22:11:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:11:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:11:48,239 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-20 22:11:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:48,248 INFO L93 Difference]: Finished difference Result 32 states and 52 transitions. [2024-11-20 22:11:48,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 52 transitions. [2024-11-20 22:11:48,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-20 22:11:48,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 46 transitions. [2024-11-20 22:11:48,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-20 22:11:48,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-20 22:11:48,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 46 transitions. [2024-11-20 22:11:48,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:48,251 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 46 transitions. [2024-11-20 22:11:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 46 transitions. [2024-11-20 22:11:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-20 22:11:48,252 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-20 22:11:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2024-11-20 22:11:48,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-20 22:11:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:11:48,254 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2024-11-20 22:11:48,254 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:11:48,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2024-11-20 22:11:48,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-20 22:11:48,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:48,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:48,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-20 22:11:48,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:48,255 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-20 22:11:48,255 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-20 22:11:48,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,256 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2024-11-20 22:11:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650739026] [2024-11-20 22:11:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2024-11-20 22:11:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748628749] [2024-11-20 22:11:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:48,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2024-11-20 22:11:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642025120] [2024-11-20 22:11:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:48,302 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:48,302 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:48,302 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:48,302 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:48,302 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:48,302 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,302 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:48,302 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:48,303 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-11-20 22:11:48,303 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:48,303 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:48,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,358 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:48,358 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:48,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,362 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-20 22:11:48,363 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-20 22:11:48,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:48,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:48,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,382 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-20 22:11:48,383 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-20 22:11:48,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:48,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,443 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:48,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:48,449 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:48,449 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:48,449 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:48,449 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:48,449 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:48,449 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,449 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:48,449 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:48,449 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration3_Loop [2024-11-20 22:11:48,449 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:48,449 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:48,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:48,504 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,506 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-20 22:11:48,507 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-20 22:11:48,508 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-20 22:11:48,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:48,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:48,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:48,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:48,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:48,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:48,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:48,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:48,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:48,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-20 22:11:48,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,542 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-20 22:11:48,543 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-20 22:11:48,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:48,544 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:48,544 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:48,544 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-20 22:11:48,550 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-20 22:11:48,551 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:48,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:48,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:48,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:48,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:48,654 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-20 22:11:48,654 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-20 22:11:48,655 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-20 22:11:48,695 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-20 22:11:48,698 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-20 22:11:48,699 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-20 22:11:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-20 22:11:48,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-20 22:11:48,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:48,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-11-20 22:11:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:48,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2024-11-20 22:11:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:48,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 104 transitions. [2024-11-20 22:11:48,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:11:48,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 98 transitions. [2024-11-20 22:11:48,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-20 22:11:48,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-20 22:11:48,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 98 transitions. [2024-11-20 22:11:48,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:48,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 98 transitions. [2024-11-20 22:11:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 98 transitions. [2024-11-20 22:11:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-20 22:11:48,706 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-20 22:11:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 94 transitions. [2024-11-20 22:11:48,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-11-20 22:11:48,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 94 transitions. [2024-11-20 22:11:48,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:11:48,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 94 transitions. [2024-11-20 22:11:48,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-20 22:11:48,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:48,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:48,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:11:48,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:48,709 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-20 22:11:48,709 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-20 22:11:48,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2024-11-20 22:11:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690013449] [2024-11-20 22:11:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:48,730 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-20 22:11:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690013449] [2024-11-20 22:11:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690013449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:11:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:11:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:11:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280169705] [2024-11-20 22:11:48,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:11:48,731 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:11:48,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 2 times [2024-11-20 22:11:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:48,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076495290] [2024-11-20 22:11:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:48,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:48,754 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:48,755 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:48,755 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:48,758 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:48,758 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:48,758 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,758 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:48,758 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:48,758 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-11-20 22:11:48,758 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:48,758 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:48,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,804 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:48,804 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:48,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,806 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-20 22:11:48,807 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-20 22:11:48,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:48,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,826 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:48,827 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-20 22:11:48,833 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-20 22:11:48,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,838 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-20 22:11:48,839 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-20 22:11:48,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:48,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,851 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:48,851 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-20 22:11:48,858 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-20 22:11:48,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,860 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-20 22:11:48,879 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-20 22:11:48,880 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-20 22:11:48,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:48,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,888 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-20 22:11:48,892 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-20 22:11:48,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:48,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:48,912 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-20 22:11:48,916 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-20 22:11:48,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:48,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:48,944 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:48,953 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-20 22:11:48,953 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:48,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:48,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:48,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:48,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:48,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:48,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:48,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:48,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2024-11-20 22:11:48,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:48,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:48,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:48,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,018 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:49,019 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,023 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-20 22:11:49,025 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-20 22:11:49,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:11:49,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:49,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:49,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:49,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:49,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:49,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:49,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:49,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,069 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-20 22:11:49,070 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-20 22:11:49,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-20 22:11:49,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:49,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:49,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:49,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:49,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:49,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:49,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:49,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:49,088 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:49,088 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-20 22:11:49,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,091 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-20 22:11:49,092 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-20 22:11:49,093 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:49,093 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:49,093 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:49,093 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-20 22:11:49,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:49,100 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:49,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,162 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-20 22:11:49,163 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-20 22:11:49,164 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-20 22:11:49,199 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-20 22:11:49,207 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-20 22:11:49,208 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-20 22:11:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-20 22:11:49,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-20 22:11:49,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-20 22:11:49,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 8 letters. [2024-11-20 22:11:49,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 190 transitions. [2024-11-20 22:11:49,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-20 22:11:49,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 107 states and 175 transitions. [2024-11-20 22:11:49,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-20 22:11:49,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-11-20 22:11:49,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 175 transitions. [2024-11-20 22:11:49,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:49,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 175 transitions. [2024-11-20 22:11:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 175 transitions. [2024-11-20 22:11:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2024-11-20 22:11:49,228 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-20 22:11:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2024-11-20 22:11:49,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 161 transitions. [2024-11-20 22:11:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:49,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:11:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:11:49,232 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-20 22:11:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:49,252 INFO L93 Difference]: Finished difference Result 107 states and 163 transitions. [2024-11-20 22:11:49,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 163 transitions. [2024-11-20 22:11:49,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2024-11-20 22:11:49,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 101 states and 153 transitions. [2024-11-20 22:11:49,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-20 22:11:49,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-20 22:11:49,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 153 transitions. [2024-11-20 22:11:49,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:49,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-20 22:11:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 153 transitions. [2024-11-20 22:11:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-20 22:11:49,266 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-20 22:11:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-11-20 22:11:49,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-20 22:11:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:11:49,272 INFO L425 stractBuchiCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-20 22:11:49,272 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:11:49,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 148 transitions. [2024-11-20 22:11:49,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2024-11-20 22:11:49,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:49,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:49,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2024-11-20 22:11:49,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:49,273 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-20 22:11:49,273 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-20 22:11:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1506873443, now seen corresponding path program 1 times [2024-11-20 22:11:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102263682] [2024-11-20 22:11:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,314 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-20 22:11:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102263682] [2024-11-20 22:11:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102263682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:11:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:11:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:11:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305998560] [2024-11-20 22:11:49,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:11:49,315 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:11:49,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 3 times [2024-11-20 22:11:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:49,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989759595] [2024-11-20 22:11:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:49,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:49,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:49,360 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:49,361 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:49,361 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:49,361 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:49,361 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:49,361 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,361 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:49,361 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:49,361 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-11-20 22:11:49,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:49,361 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:49,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,420 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:49,420 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:49,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,421 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-20 22:11:49,423 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-20 22:11:49,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:49,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:49,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,447 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-20 22:11:49,449 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-20 22:11:49,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:49,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:49,464 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:49,470 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-20 22:11:49,471 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:49,471 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:49,471 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:49,471 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:49,471 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:49,471 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,471 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:49,471 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:49,471 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2024-11-20 22:11:49,471 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:49,471 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:49,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,517 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:49,517 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,519 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-20 22:11:49,521 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-20 22:11:49,522 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-20 22:11:49,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:49,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:49,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:49,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:49,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:49,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:49,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:49,544 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-20 22:11:49,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,546 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-20 22:11:49,547 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-20 22:11:49,548 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-20 22:11:49,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:49,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:49,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:49,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:49,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:49,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:49,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:49,564 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:49,569 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:49,569 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-20 22:11:49,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,575 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-20 22:11:49,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:49,577 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:49,577 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:49,577 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-20 22:11:49,580 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-20 22:11:49,586 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-20 22:11:49,587 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,638 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-20 22:11:49,638 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-20 22:11:49,638 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-20 22:11:49,661 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-20 22:11:49,666 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-20 22:11:49,667 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-20 22:11:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-20 22:11:49,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-20 22:11:49,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,667 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,712 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-20 22:11:49,713 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-20 22:11:49,713 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-20 22:11:49,731 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-20 22:11:49,731 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-20 22:11:49,732 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-20 22:11:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-20 22:11:49,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-20 22:11:49,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,732 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:11:49,786 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-20 22:11:49,786 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-20 22:11:49,806 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-20 22:11:49,806 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-20 22:11:49,807 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-20 22:11:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-11-20 22:11:49,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-20 22:11:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-20 22:11:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 8 letters. [2024-11-20 22:11:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:49,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 250 transitions. [2024-11-20 22:11:49,809 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2024-11-20 22:11:49,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 119 states and 180 transitions. [2024-11-20 22:11:49,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-20 22:11:49,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-20 22:11:49,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 180 transitions. [2024-11-20 22:11:49,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:49,810 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-20 22:11:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 180 transitions. [2024-11-20 22:11:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2024-11-20 22:11:49,813 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-20 22:11:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-20 22:11:49,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-20 22:11:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 22:11:49,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 22:11:49,814 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-20 22:11:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:49,820 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-11-20 22:11:49,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2024-11-20 22:11:49,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-20 22:11:49,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 68 transitions. [2024-11-20 22:11:49,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-20 22:11:49,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-20 22:11:49,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 68 transitions. [2024-11-20 22:11:49,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:49,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-20 22:11:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 68 transitions. [2024-11-20 22:11:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-20 22:11:49,823 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-20 22:11:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-11-20 22:11:49,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-20 22:11:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 22:11:49,828 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-20 22:11:49,828 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:11:49,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 65 transitions. [2024-11-20 22:11:49,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-20 22:11:49,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:49,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:49,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:11:49,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:49,829 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-20 22:11:49,829 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-20 22:11:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1179049836, now seen corresponding path program 1 times [2024-11-20 22:11:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711487554] [2024-11-20 22:11:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,854 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-20 22:11:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711487554] [2024-11-20 22:11:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711487554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:11:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097489137] [2024-11-20 22:11:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:11:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:49,856 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-20 22:11:49,857 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-20 22:11:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:49,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 22:11:49,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:49,889 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-20 22:11:49,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:11:49,904 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-20 22:11:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097489137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:11:49,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:11:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-20 22:11:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332122675] [2024-11-20 22:11:49,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:11:49,905 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:11:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 2 times [2024-11-20 22:11:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798600423] [2024-11-20 22:11:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:49,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:49,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:49,942 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:49,942 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:49,942 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:49,942 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:49,942 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:49,942 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:49,942 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:49,942 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:49,942 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-11-20 22:11:49,942 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:49,942 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:49,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:49,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,007 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:50,007 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:50,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,009 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-20 22:11:50,010 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-20 22:11:50,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:50,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:50,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:50,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,039 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-20 22:11:50,040 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-20 22:11:50,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:50,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:50,079 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:50,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-20 22:11:50,083 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:50,083 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:50,083 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:50,083 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:50,083 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:50,083 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,083 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:50,083 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:50,084 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2024-11-20 22:11:50,084 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:50,084 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:50,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,155 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:50,155 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:50,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,158 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-20 22:11:50,159 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-20 22:11:50,163 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-20 22:11:50,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:50,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:50,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:50,173 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:11:50,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:50,175 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-20 22:11:50,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:50,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:50,180 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:50,180 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-20 22:11:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,182 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-20 22:11:50,183 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-20 22:11:50,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:50,183 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:50,183 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:50,184 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-20 22:11:50,189 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-20 22:11:50,190 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:50,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,229 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-20 22:11:50,230 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-20 22:11:50,230 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-20 22:11:50,253 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-20 22:11:50,257 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-20 22:11:50,258 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-20 22:11:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-20 22:11:50,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-20 22:11:50,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,258 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:50,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,311 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-20 22:11:50,311 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-20 22:11:50,312 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-20 22:11:50,328 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-20 22:11:50,328 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-20 22:11:50,329 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-20 22:11:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-11-20 22:11:50,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-20 22:11:50,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,329 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,362 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-20 22:11:50,362 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-20 22:11:50,363 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-20 22:11:50,379 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-20 22:11:50,380 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-20 22:11:50,380 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-20 22:11:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-20 22:11:50,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2024-11-20 22:11:50,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-20 22:11:50,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 8 letters. [2024-11-20 22:11:50,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 124 transitions. [2024-11-20 22:11:50,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-20 22:11:50,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 56 states and 76 transitions. [2024-11-20 22:11:50,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-20 22:11:50,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-20 22:11:50,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 76 transitions. [2024-11-20 22:11:50,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:50,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-20 22:11:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 76 transitions. [2024-11-20 22:11:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-11-20 22:11:50,384 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-20 22:11:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-20 22:11:50,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-20 22:11:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 22:11:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 22:11:50,385 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-20 22:11:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:50,417 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-11-20 22:11:50,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2024-11-20 22:11:50,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-20 22:11:50,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 72 states and 93 transitions. [2024-11-20 22:11:50,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-20 22:11:50,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2024-11-20 22:11:50,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 93 transitions. [2024-11-20 22:11:50,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:50,419 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-11-20 22:11:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 93 transitions. [2024-11-20 22:11:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-11-20 22:11:50,420 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-20 22:11:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-11-20 22:11:50,421 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-20 22:11:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 22:11:50,421 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-11-20 22:11:50,421 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:11:50,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 85 transitions. [2024-11-20 22:11:50,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-20 22:11:50,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:50,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:50,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:11:50,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:50,423 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-20 22:11:50,423 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-20 22:11:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 2 times [2024-11-20 22:11:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716558820] [2024-11-20 22:11:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,456 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-20 22:11:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716558820] [2024-11-20 22:11:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716558820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:11:50,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:11:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 22:11:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107789793] [2024-11-20 22:11:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:11:50,460 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:11:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2024-11-20 22:11:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278239797] [2024-11-20 22:11:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:50,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:50,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:50,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-20 22:11:50,509 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-20 22:11:50,514 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-20 22:11:50,536 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:50,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:50,536 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:50,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:50,536 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:50,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:50,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:50,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-11-20 22:11:50,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:50,536 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:50,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,595 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:50,595 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:50,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,597 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-20 22:11:50,603 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-20 22:11:50,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:50,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:50,622 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:50,622 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-20 22:11:50,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,633 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-20 22:11:50,637 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-20 22:11:50,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:50,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:50,658 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:50,658 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-20 22:11:50,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-20 22:11:50,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,670 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-20 22:11:50,672 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-20 22:11:50,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:50,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:50,693 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-20 22:11:50,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,697 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-20 22:11:50,699 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-20 22:11:50,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:50,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:50,714 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:50,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-20 22:11:50,724 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:50,724 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:50,724 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:50,724 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:50,724 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:50,724 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,724 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:50,724 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:50,724 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2024-11-20 22:11:50,725 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:50,725 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:50,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:50,785 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:50,785 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:50,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,788 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-20 22:11:50,788 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-20 22:11:50,789 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-20 22:11:50,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:50,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:50,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:50,799 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-20 22:11:50,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:50,800 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-20 22:11:50,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:50,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:50,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:50,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,811 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-20 22:11:50,813 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-20 22:11:50,817 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-20 22:11:50,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:50,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:50,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:50,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:50,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:50,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:50,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:50,839 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-20 22:11:50,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,844 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-20 22:11:50,845 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-20 22:11:50,847 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-20 22:11:50,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:50,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:50,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:50,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:50,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:50,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:50,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:50,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-20 22:11:50,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,872 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-20 22:11:50,875 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-20 22:11:50,875 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-20 22:11:50,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:50,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:50,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:50,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:50,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:50,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:50,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:50,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:50,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:50,891 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-20 22:11:50,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:50,894 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-20 22:11:50,897 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-20 22:11:50,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:50,897 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:50,897 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:50,897 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-20 22:11:50,903 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-20 22:11:50,904 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:50,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:50,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:50,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:50,949 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-20 22:11:50,949 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-20 22:11:50,949 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-20 22:11:50,973 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-20 22:11:50,973 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-20 22:11:50,974 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-20 22:11:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-20 22:11:50,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2024-11-20 22:11:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2024-11-20 22:11:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2024-11-20 22:11:50,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:50,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 209 transitions. [2024-11-20 22:11:50,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-20 22:11:50,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 126 states and 161 transitions. [2024-11-20 22:11:50,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-20 22:11:50,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:11:50,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 161 transitions. [2024-11-20 22:11:50,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:50,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-11-20 22:11:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 161 transitions. [2024-11-20 22:11:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-11-20 22:11:50,979 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-20 22:11:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2024-11-20 22:11:50,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2024-11-20 22:11:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 22:11:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 22:11:50,980 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-20 22:11:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:50,997 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2024-11-20 22:11:50,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 174 transitions. [2024-11-20 22:11:50,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-20 22:11:50,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 174 transitions. [2024-11-20 22:11:50,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-20 22:11:50,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-20 22:11:50,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 174 transitions. [2024-11-20 22:11:50,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:50,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 174 transitions. [2024-11-20 22:11:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 174 transitions. [2024-11-20 22:11:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2024-11-20 22:11:51,001 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-20 22:11:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2024-11-20 22:11:51,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-20 22:11:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 22:11:51,002 INFO L425 stractBuchiCegarLoop]: Abstraction has 117 states and 147 transitions. [2024-11-20 22:11:51,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-20 22:11:51,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 147 transitions. [2024-11-20 22:11:51,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-11-20 22:11:51,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:51,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:51,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2024-11-20 22:11:51,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-20 22:11:51,004 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-20 22:11:51,004 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-20 22:11:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 3 times [2024-11-20 22:11:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890499820] [2024-11-20 22:11:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 22:11:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890499820] [2024-11-20 22:11:51,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890499820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:11:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068511765] [2024-11-20 22:11:51,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 22:11:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:11:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,080 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-20 22:11:51,083 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-20 22:11:51,103 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-20 22:11:51,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:11:51,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,125 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-20 22:11:51,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:11:51,155 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-20 22:11:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068511765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:11:51,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:11:51,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2024-11-20 22:11:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574583690] [2024-11-20 22:11:51,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:11:51,156 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:11:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2024-11-20 22:11:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471646212] [2024-11-20 22:11:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:51,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:51,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:51,180 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:51,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:51,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:51,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:51,180 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:51,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:51,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:51,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-11-20 22:11:51,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:51,180 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:51,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,232 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:51,232 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:51,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,233 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-20 22:11:51,235 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-20 22:11:51,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:51,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:51,253 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:51,254 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-20 22:11:51,260 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-20 22:11:51,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,262 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-20 22:11:51,263 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-20 22:11:51,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:51,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:51,281 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-20 22:11:51,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,283 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-20 22:11:51,284 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-20 22:11:51,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:51,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:51,295 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:51,301 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-20 22:11:51,302 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:51,302 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:51,302 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:51,302 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:51,302 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:51,302 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,302 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:51,302 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:51,302 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration8_Loop [2024-11-20 22:11:51,302 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:51,302 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:51,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:51,350 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:51,350 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:51,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,352 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-20 22:11:51,353 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-20 22:11:51,355 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-20 22:11:51,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:51,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:51,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:51,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:51,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:51,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:51,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:51,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-20 22:11:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,378 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-20 22:11:51,379 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-20 22:11:51,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-20 22:11:51,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:51,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:51,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:51,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:51,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:51,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:51,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:51,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:51,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:51,397 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-20 22:11:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,400 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-20 22:11:51,401 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-20 22:11:51,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:51,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:51,402 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:51,402 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-20 22:11:51,408 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-20 22:11:51,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:51,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,464 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-20 22:11:51,465 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-20 22:11:51,465 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-20 22:11:51,481 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-20 22:11:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:11:51,482 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-20 22:11:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-20 22:11:51,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-20 22:11:51,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:51,482 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,531 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-20 22:11:51,531 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-20 22:11:51,532 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-20 22:11:51,550 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-20 22:11:51,550 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-20 22:11:51,550 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-20 22:11:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-20 22:11:51,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-20 22:11:51,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:51,551 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,602 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-20 22:11:51,602 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-20 22:11:51,602 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-20 22:11:51,618 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-20 22:11:51,619 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-20 22:11:51,619 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-20 22:11:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2024-11-20 22:11:51,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2024-11-20 22:11:51,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:51,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2024-11-20 22:11:51,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:51,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2024-11-20 22:11:51,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:51,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 219 transitions. [2024-11-20 22:11:51,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-20 22:11:51,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 121 states and 151 transitions. [2024-11-20 22:11:51,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-20 22:11:51,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-20 22:11:51,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 151 transitions. [2024-11-20 22:11:51,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:51,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 151 transitions. [2024-11-20 22:11:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 151 transitions. [2024-11-20 22:11:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2024-11-20 22:11:51,624 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-20 22:11:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2024-11-20 22:11:51,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 95 transitions. [2024-11-20 22:11:51,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:51,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 22:11:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-20 22:11:51,625 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:11:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:51,686 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2024-11-20 22:11:51,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 194 transitions. [2024-11-20 22:11:51,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2024-11-20 22:11:51,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 153 states and 188 transitions. [2024-11-20 22:11:51,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:11:51,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:11:51,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 188 transitions. [2024-11-20 22:11:51,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:51,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 188 transitions. [2024-11-20 22:11:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 188 transitions. [2024-11-20 22:11:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 104. [2024-11-20 22:11:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:11:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-11-20 22:11:51,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-11-20 22:11:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 22:11:51,691 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-11-20 22:11:51,691 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-20 22:11:51,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 126 transitions. [2024-11-20 22:11:51,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2024-11-20 22:11:51,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:51,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:51,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-20 22:11:51,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 6, 5, 1, 1] [2024-11-20 22:11:51,693 INFO L745 eck$LassoCheckResult]: Stem: 4223#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4218#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4220#L12 assume !(10 == main_~i~0#1); 4243#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4241#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4233#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4234#L12 [2024-11-20 22:11:51,693 INFO L747 eck$LassoCheckResult]: Loop: 4234#L12 assume !(10 == main_~i~0#1); 4262#L12-2 assume !(0 == main_~i~0#1); 4261#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4260#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4259#L12 assume !(10 == main_~i~0#1); 4258#L12-2 assume !(0 == main_~i~0#1); 4257#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4256#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4255#L12 assume !(10 == main_~i~0#1); 4254#L12-2 assume !(0 == main_~i~0#1); 4253#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4252#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4251#L12 assume !(10 == main_~i~0#1); 4250#L12-2 assume !(0 == main_~i~0#1); 4249#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4248#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4247#L12 assume !(10 == main_~i~0#1); 4237#L12-2 assume !(0 == main_~i~0#1); 4240#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4236#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4238#L12-2 assume !(0 == main_~i~0#1); 4302#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4301#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4300#L12 assume !(10 == main_~i~0#1); 4299#L12-2 assume !(0 == main_~i~0#1); 4298#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4297#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4296#L12 assume !(10 == main_~i~0#1); 4295#L12-2 assume !(0 == main_~i~0#1); 4294#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4293#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4292#L12 assume !(10 == main_~i~0#1); 4291#L12-2 assume !(0 == main_~i~0#1); 4290#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4289#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4287#L12 assume !(10 == main_~i~0#1); 4286#L12-2 assume !(0 == main_~i~0#1); 4284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4285#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4220#L12 assume !(10 == main_~i~0#1); 4243#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4241#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4233#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4234#L12 [2024-11-20 22:11:51,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 2 times [2024-11-20 22:11:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896418742] [2024-11-20 22:11:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:51,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:51,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1466490324, now seen corresponding path program 1 times [2024-11-20 22:11:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747451297] [2024-11-20 22:11:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 22:11:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747451297] [2024-11-20 22:11:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747451297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:11:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193700119] [2024-11-20 22:11:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:11:51,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:51,794 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-20 22:11:51,808 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-20 22:11:51,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-20 22:11:51,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-20 22:11:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:51,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 22:11:51,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 22:11:51,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:11:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-20 22:11:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193700119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:11:51,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:11:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-20 22:11:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473581844] [2024-11-20 22:11:51,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:11:51,929 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:11:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 22:11:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-20 22:11:51,930 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. cyclomatic complexity: 26 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:11:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:51,984 INFO L93 Difference]: Finished difference Result 198 states and 243 transitions. [2024-11-20 22:11:51,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 243 transitions. [2024-11-20 22:11:51,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2024-11-20 22:11:51,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 173 states and 213 transitions. [2024-11-20 22:11:51,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-20 22:11:51,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-20 22:11:51,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 213 transitions. [2024-11-20 22:11:51,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:51,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 213 transitions. [2024-11-20 22:11:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 213 transitions. [2024-11-20 22:11:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 164. [2024-11-20 22:11:51,987 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-20 22:11:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2024-11-20 22:11:51,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-11-20 22:11:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:11:51,988 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-11-20 22:11:51,988 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-20 22:11:51,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 201 transitions. [2024-11-20 22:11:51,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2024-11-20 22:11:51,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:51,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:51,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-20 22:11:51,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2024-11-20 22:11:51,990 INFO L745 eck$LassoCheckResult]: Stem: 4798#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4793#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4795#L12 assume !(10 == main_~i~0#1); 4837#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4807#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4808#L12 [2024-11-20 22:11:51,990 INFO L747 eck$LassoCheckResult]: Loop: 4808#L12 assume !(10 == main_~i~0#1); 4829#L12-2 assume !(0 == main_~i~0#1); 4828#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4827#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4826#L12 assume !(10 == main_~i~0#1); 4825#L12-2 assume !(0 == main_~i~0#1); 4824#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4823#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4822#L12 assume !(10 == main_~i~0#1); 4821#L12-2 assume !(0 == main_~i~0#1); 4820#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4819#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4818#L12 assume !(10 == main_~i~0#1); 4817#L12-2 assume !(0 == main_~i~0#1); 4816#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4815#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4814#L12 assume !(10 == main_~i~0#1); 4811#L12-2 assume !(0 == main_~i~0#1); 4813#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4812#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4810#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4790#L12-2 assume !(0 == main_~i~0#1); 4791#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4796#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4797#L12 assume !(10 == main_~i~0#1); 4804#L12-2 assume !(0 == main_~i~0#1); 4953#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4952#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4951#L12 assume !(10 == main_~i~0#1); 4950#L12-2 assume !(0 == main_~i~0#1); 4949#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4948#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4947#L12 assume !(10 == main_~i~0#1); 4946#L12-2 assume !(0 == main_~i~0#1); 4945#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4944#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4943#L12 assume !(10 == main_~i~0#1); 4942#L12-2 assume !(0 == main_~i~0#1); 4941#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4940#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4939#L12 assume !(10 == main_~i~0#1); 4938#L12-2 assume !(0 == main_~i~0#1); 4937#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4936#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4935#L12 assume !(10 == main_~i~0#1); 4934#L12-2 assume !(0 == main_~i~0#1); 4933#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4932#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4931#L12 assume !(10 == main_~i~0#1); 4930#L12-2 assume !(0 == main_~i~0#1); 4929#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4928#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4927#L12 assume !(10 == main_~i~0#1); 4926#L12-2 assume !(0 == main_~i~0#1); 4925#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4924#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4844#L12 assume !(10 == main_~i~0#1); 4923#L12-2 assume !(0 == main_~i~0#1); 4888#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4843#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4795#L12 assume !(10 == main_~i~0#1); 4837#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4807#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4808#L12 [2024-11-20 22:11:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 3 times [2024-11-20 22:11:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259149586] [2024-11-20 22:11:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:51,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:51,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 726843037, now seen corresponding path program 2 times [2024-11-20 22:11:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842320028] [2024-11-20 22:11:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:52,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:52,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:52,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1110135673, now seen corresponding path program 4 times [2024-11-20 22:11:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280344688] [2024-11-20 22:11:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 296 proven. 55 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-20 22:11:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280344688] [2024-11-20 22:11:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280344688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:11:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802360926] [2024-11-20 22:11:52,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 22:11:52,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:11:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,093 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-20 22:11:52,095 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-20 22:11:52,122 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 22:11:52,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 22:11:52,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 22:11:52,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:52,148 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-20 22:11:52,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:11:52,213 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-20 22:11:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802360926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:11:52,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:11:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-20 22:11:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801819201] [2024-11-20 22:11:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:11:52,474 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:52,474 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:52,474 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:52,474 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:52,474 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-20 22:11:52,474 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,474 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:52,474 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:52,474 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-11-20 22:11:52,474 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:52,474 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:52,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,514 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:52,514 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-20 22:11:52,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,516 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-20 22:11:52,518 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-20 22:11:52,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:52,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:52,538 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-20 22:11:52,539 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-20 22:11:52,544 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-20 22:11:52,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,546 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-20 22:11:52,546 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-20 22:11:52,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-20 22:11:52,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:52,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:52,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,574 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-20 22:11:52,575 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-20 22:11:52,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-20 22:11:52,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-20 22:11:52,590 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-20 22:11:52,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:52,596 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:11:52,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:11:52,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:11:52,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:11:52,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:11:52,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:11:52,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:11:52,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2024-11-20 22:11:52,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:11:52,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:11:52,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:11:52,659 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:11:52,659 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:11:52,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,663 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-20 22:11:52,664 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-20 22:11:52,665 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-20 22:11:52,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:52,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:52,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:52,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:52,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:11:52,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:11:52,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:11:52,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:52,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,690 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:11:52,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-20 22:11:52,692 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-20 22:11:52,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:11:52,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:11:52,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:11:52,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:11:52,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:11:52,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:11:52,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:11:52,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:11:52,708 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-20 22:11:52,708 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-20 22:11:52,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:11:52,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:11:52,709 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:11:52,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-20 22:11:52,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:11:52,712 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-20 22:11:52,712 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:11:52,712 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-20 22:11:52,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:52,718 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-20 22:11:52,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:52,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:52,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:52,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:11:52,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:52,878 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-20 22:11:52,878 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-20 22:11:52,878 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-20 22:11:53,018 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-20 22:11:53,021 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-20 22:11:53,022 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-20 22:11:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2024-11-20 22:11:53,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-20 22:11:53,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:53,022 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:53,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:53,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:53,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:53,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:11:53,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:53,276 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-20 22:11:53,276 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-20 22:11:53,276 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-20 22:11:53,586 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-20 22:11:53,586 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-20 22:11:53,586 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-20 22:11:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2024-11-20 22:11:53,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 67 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-20 22:11:53,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:53,587 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:53,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:53,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:53,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:53,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:11:53,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:53,813 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-20 22:11:53,813 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-20 22:11:53,813 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-20 22:11:54,113 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-20 22:11:54,117 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-20 22:11:54,117 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-20 22:11:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 76 transitions. [2024-11-20 22:11:54,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 76 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-20 22:11:54,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:54,119 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-20 22:11:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:54,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:11:54,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:54,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 22:11:54,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:11:54,336 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-20 22:11:54,336 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-20 22:11:54,337 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-20 22:11:54,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:54,618 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-20 22:11:54,618 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-20 22:11:54,619 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-20 22:11:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2024-11-20 22:11:54,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 64 letters. [2024-11-20 22:11:54,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:54,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 71 letters. Loop has 64 letters. [2024-11-20 22:11:54,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:54,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 78 transitions. Stem has 7 letters. Loop has 128 letters. [2024-11-20 22:11:54,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:11:54,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1639 states and 1887 transitions. [2024-11-20 22:11:54,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2024-11-20 22:11:54,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1639 states to 522 states and 614 transitions. [2024-11-20 22:11:54,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-20 22:11:54,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2024-11-20 22:11:54,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 614 transitions. [2024-11-20 22:11:54,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:54,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 522 states and 614 transitions. [2024-11-20 22:11:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 614 transitions. [2024-11-20 22:11:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 163. [2024-11-20 22:11:54,634 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-20 22:11:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-11-20 22:11:54,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-11-20 22:11:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 22:11:54,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-20 22:11:54,634 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-20 22:11:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:54,681 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2024-11-20 22:11:54,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 454 transitions. [2024-11-20 22:11:54,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 195 [2024-11-20 22:11:54,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 298 states and 353 transitions. [2024-11-20 22:11:54,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2024-11-20 22:11:54,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2024-11-20 22:11:54,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 353 transitions. [2024-11-20 22:11:54,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:54,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 298 states and 353 transitions. [2024-11-20 22:11:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 353 transitions. [2024-11-20 22:11:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 152. [2024-11-20 22:11:54,685 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-20 22:11:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2024-11-20 22:11:54,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-20 22:11:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 22:11:54,690 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 183 transitions. [2024-11-20 22:11:54,690 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-20 22:11:54,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 183 transitions. [2024-11-20 22:11:54,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2024-11-20 22:11:54,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:54,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:54,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-20 22:11:54,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 20, 19, 11, 10, 2, 1] [2024-11-20 22:11:54,691 INFO L745 eck$LassoCheckResult]: Stem: 11568#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 11573#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11583#L12 assume !(10 == main_~i~0#1); 11586#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11577#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11578#L12 [2024-11-20 22:11:54,691 INFO L747 eck$LassoCheckResult]: Loop: 11578#L12 assume !(10 == main_~i~0#1); 11666#L12-2 assume !(0 == main_~i~0#1); 11665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11664#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11663#L12 assume !(10 == main_~i~0#1); 11662#L12-2 assume !(0 == main_~i~0#1); 11661#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11660#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11659#L12 assume !(10 == main_~i~0#1); 11658#L12-2 assume !(0 == main_~i~0#1); 11657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11656#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11655#L12 assume !(10 == main_~i~0#1); 11652#L12-2 assume !(0 == main_~i~0#1); 11654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11653#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11651#L12 assume !(10 == main_~i~0#1); 11560#L12-2 assume !(0 == main_~i~0#1); 11561#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11564#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11565#L12 assume !(10 == main_~i~0#1); 11650#L12-2 assume !(0 == main_~i~0#1); 11649#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11648#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11647#L12 assume !(10 == main_~i~0#1); 11646#L12-2 assume !(0 == main_~i~0#1); 11645#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11644#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11643#L12 assume !(10 == main_~i~0#1); 11642#L12-2 assume !(0 == main_~i~0#1); 11641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11640#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11639#L12 assume !(10 == main_~i~0#1); 11638#L12-2 assume !(0 == main_~i~0#1); 11637#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11636#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11635#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11634#L12-2 assume !(0 == main_~i~0#1); 11633#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11632#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11631#L12 assume !(10 == main_~i~0#1); 11630#L12-2 assume !(0 == main_~i~0#1); 11629#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11628#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11627#L12 assume !(10 == main_~i~0#1); 11626#L12-2 assume !(0 == main_~i~0#1); 11625#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11624#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11623#L12 assume !(10 == main_~i~0#1); 11622#L12-2 assume !(0 == main_~i~0#1); 11621#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11620#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11619#L12 assume !(10 == main_~i~0#1); 11618#L12-2 assume !(0 == main_~i~0#1); 11617#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11616#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11615#L12 assume !(10 == main_~i~0#1); 11614#L12-2 assume !(0 == main_~i~0#1); 11613#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11612#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11611#L12 assume !(10 == main_~i~0#1); 11610#L12-2 assume !(0 == main_~i~0#1); 11609#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11608#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11607#L12 assume !(10 == main_~i~0#1); 11606#L12-2 assume !(0 == main_~i~0#1); 11605#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11604#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11603#L12 assume !(10 == main_~i~0#1); 11602#L12-2 assume !(0 == main_~i~0#1); 11601#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11600#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11596#L12 assume !(10 == main_~i~0#1); 11598#L12-2 assume !(0 == main_~i~0#1); 11597#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11595#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11594#L12 assume !(10 == main_~i~0#1); 11592#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11593#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11668#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11579#L12 assume !(10 == main_~i~0#1); 11589#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11577#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11578#L12 [2024-11-20 22:11:54,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724061, now seen corresponding path program 4 times [2024-11-20 22:11:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567646792] [2024-11-20 22:11:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1840948782, now seen corresponding path program 3 times [2024-11-20 22:11:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798216138] [2024-11-20 22:11:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:11:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 22:11:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:11:54,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798216138] [2024-11-20 22:11:54,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798216138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:11:54,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:11:54,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:11:54,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058091278] [2024-11-20 22:11:54,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:11:54,743 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-20 22:11:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:11:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 22:11:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 22:11:54,743 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:11:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:11:54,772 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2024-11-20 22:11:54,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 181 transitions. [2024-11-20 22:11:54,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-20 22:11:54,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 144 states and 170 transitions. [2024-11-20 22:11:54,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-20 22:11:54,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-20 22:11:54,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 170 transitions. [2024-11-20 22:11:54,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-20 22:11:54,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-11-20 22:11:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 170 transitions. [2024-11-20 22:11:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2024-11-20 22:11:54,774 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-20 22:11:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2024-11-20 22:11:54,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-11-20 22:11:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 22:11:54,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2024-11-20 22:11:54,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-20 22:11:54,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2024-11-20 22:11:54,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2024-11-20 22:11:54,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:11:54,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:11:54,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 1, 1, 1] [2024-11-20 22:11:54,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2024-11-20 22:11:54,784 INFO L745 eck$LassoCheckResult]: Stem: 11878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 11879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 11882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11891#L12 assume !(10 == main_~i~0#1); 11892#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11893#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11874#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11875#L12 assume !(10 == main_~i~0#1); 11927#L12-2 assume !(0 == main_~i~0#1); 11926#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11925#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11924#L12 assume !(10 == main_~i~0#1); 11923#L12-2 assume !(0 == main_~i~0#1); 11922#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11921#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11920#L12 assume !(10 == main_~i~0#1); 11919#L12-2 assume !(0 == main_~i~0#1); 11918#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11917#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11916#L12 assume !(10 == main_~i~0#1); 11912#L12-2 assume !(0 == main_~i~0#1); 11915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11914#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11911#L12 assume !(10 == main_~i~0#1); 11894#L12-2 [2024-11-20 22:11:54,784 INFO L747 eck$LassoCheckResult]: Loop: 11894#L12-2 assume !(0 == main_~i~0#1); 11887#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11888#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11913#L12 assume !(10 == main_~i~0#1); 11910#L12-2 assume !(0 == main_~i~0#1); 11909#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11908#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11907#L12 assume !(10 == main_~i~0#1); 11906#L12-2 assume !(0 == main_~i~0#1); 11905#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11904#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11903#L12 assume !(10 == main_~i~0#1); 11902#L12-2 assume !(0 == main_~i~0#1); 11901#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11900#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11899#L12 assume !(10 == main_~i~0#1); 11898#L12-2 assume !(0 == main_~i~0#1); 11897#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11896#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11895#L12 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11871#L12-2 assume !(0 == main_~i~0#1); 11872#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11876#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11877#L12 assume !(10 == main_~i~0#1); 11969#L12-2 assume !(0 == main_~i~0#1); 11968#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11967#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11966#L12 assume !(10 == main_~i~0#1); 11965#L12-2 assume !(0 == main_~i~0#1); 11964#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11963#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11962#L12 assume !(10 == main_~i~0#1); 11961#L12-2 assume !(0 == main_~i~0#1); 11960#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11959#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11958#L12 assume !(10 == main_~i~0#1); 11957#L12-2 assume !(0 == main_~i~0#1); 11956#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11955#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11954#L12 assume !(10 == main_~i~0#1); 11953#L12-2 assume !(0 == main_~i~0#1); 11952#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11951#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11950#L12 assume !(10 == main_~i~0#1); 11949#L12-2 assume !(0 == main_~i~0#1); 11948#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11947#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11946#L12 assume !(10 == main_~i~0#1); 11945#L12-2 assume !(0 == main_~i~0#1); 11944#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11943#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11942#L12 assume !(10 == main_~i~0#1); 11941#L12-2 assume !(0 == main_~i~0#1); 11940#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11939#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11936#L12 assume !(10 == main_~i~0#1); 11938#L12-2 assume !(0 == main_~i~0#1); 11937#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11935#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11934#L12 assume !(10 == main_~i~0#1); 11884#L12-2 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 11933#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11930#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11928#L12 assume !(10 == main_~i~0#1); 11927#L12-2 assume !(0 == main_~i~0#1); 11926#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11925#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11924#L12 assume !(10 == main_~i~0#1); 11923#L12-2 assume !(0 == main_~i~0#1); 11922#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11921#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11920#L12 assume !(10 == main_~i~0#1); 11919#L12-2 assume !(0 == main_~i~0#1); 11918#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11917#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11916#L12 assume !(10 == main_~i~0#1); 11912#L12-2 assume !(0 == main_~i~0#1); 11915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11914#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 11911#L12 assume !(10 == main_~i~0#1); 11894#L12-2 [2024-11-20 22:11:54,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash 781927031, now seen corresponding path program 1 times [2024-11-20 22:11:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743937551] [2024-11-20 22:11:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:54,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 921517193, now seen corresponding path program 4 times [2024-11-20 22:11:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111873121] [2024-11-20 22:11:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:54,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:11:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 933372671, now seen corresponding path program 5 times [2024-11-20 22:11:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:11:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568333176] [2024-11-20 22:11:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:11:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:11:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:54,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:11:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:55,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:11:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:11:55,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:11:55 BoogieIcfgContainer [2024-11-20 22:11:55,420 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:11:55,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:11:55,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:11:55,420 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:11:55,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:11:46" (3/4) ... [2024-11-20 22:11:55,424 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-20 22:11:55,506 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 22:11:55,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:11:55,507 INFO L158 Benchmark]: Toolchain (without parser) took 9215.97ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 98.4MB in the beginning and 94.2MB in the end (delta: 4.2MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2024-11-20 22:11:55,507 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:11:55,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.71ms. Allocated memory is still 151.0MB. Free memory was 98.4MB in the beginning and 86.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 22:11:55,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.07ms. Allocated memory is still 151.0MB. Free memory was 86.6MB in the beginning and 85.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:11:55,508 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 151.0MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:11:55,508 INFO L158 Benchmark]: RCFGBuilder took 191.36ms. Allocated memory is still 151.0MB. Free memory was 83.7MB in the beginning and 74.5MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 22:11:55,508 INFO L158 Benchmark]: BuchiAutomizer took 8692.81ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 74.5MB in the beginning and 98.4MB in the end (delta: -23.9MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-11-20 22:11:55,508 INFO L158 Benchmark]: Witness Printer took 86.56ms. Allocated memory is still 260.0MB. Free memory was 98.4MB in the beginning and 94.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 22:11:55,509 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.15ms. Allocated memory is still 151.0MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.71ms. Allocated memory is still 151.0MB. Free memory was 98.4MB in the beginning and 86.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.07ms. Allocated memory is still 151.0MB. Free memory was 86.6MB in the beginning and 85.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 151.0MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 191.36ms. Allocated memory is still 151.0MB. Free memory was 83.7MB in the beginning and 74.5MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 8692.81ms. Allocated memory was 151.0MB in the beginning and 260.0MB in the end (delta: 109.1MB). Free memory was 74.5MB in the beginning and 98.4MB in the end (delta: -23.9MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. * Witness Printer took 86.56ms. Allocated memory is still 260.0MB. Free memory was 98.4MB in the beginning and 94.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (9 trivial, 5 deterministic, 4 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 5 locations. One deterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 1) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 19) and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 16 locations. 9 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 101 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 12 iterations. TraceHistogramMax:21. Analysis of lassos took 5.0s. Construction of modules took 0.6s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 18. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 766 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 220/480 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 523 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 201 mSDtfsCounter, 918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax182 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq184 hnf91 smp94 dnf122 smp94 tf111 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i == 10) VAL [i=0, up=0] [L15] COND TRUE i == 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i == 10) VAL [i=1, up=1] [L15] COND FALSE !(i == 0) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=1] [L12] COND FALSE !(i == 10) VAL [i=2, up=1] [L15] COND FALSE !(i == 0) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=1] [L12] COND FALSE !(i == 10) VAL [i=3, up=1] [L15] COND FALSE !(i == 0) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=1] [L12] COND FALSE !(i == 10) VAL [i=4, up=1] [L15] COND FALSE !(i == 0) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=1] [L12] COND FALSE !(i == 10) VAL [i=5, up=1] Loop: [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 15]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i == 10) VAL [i=0, up=0] [L15] COND TRUE i == 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i == 10) VAL [i=1, up=1] [L15] COND FALSE !(i == 0) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=2, up=1] [L12] COND FALSE !(i == 10) VAL [i=2, up=1] [L15] COND FALSE !(i == 0) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=3, up=1] [L12] COND FALSE !(i == 10) VAL [i=3, up=1] [L15] COND FALSE !(i == 0) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=4, up=1] [L12] COND FALSE !(i == 10) VAL [i=4, up=1] [L15] COND FALSE !(i == 0) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=5, up=1] [L12] COND FALSE !(i == 10) VAL [i=5, up=1] Loop: [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-20 22:11:55,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:55,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-11-20 22:11:55,927 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-20 22:11:56,128 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-20 22:11:56,332 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)