./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/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.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 e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:57:46,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:57:46,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 16:57:46,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:57:46,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:57:46,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:57:46,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:57:46,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:57:46,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:57:46,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:57:46,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:57:46,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:57:46,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:57:46,778 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 16:57:46,779 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 16:57:46,779 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 16:57:46,781 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 16:57:46,782 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 16:57:46,783 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 16:57:46,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:57:46,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 16:57:46,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:57:46,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:57:46,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 16:57:46,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 16:57:46,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 16:57:46,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:57:46,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:57:46,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:57:46,787 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 16:57:46,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:57:46,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:57:46,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:57:46,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:57:46,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:57:46,788 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 16:57:46,788 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 -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2024-10-13 16:57:46,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:57:47,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:57:47,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:57:47,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:57:47,007 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:57:47,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-10-13 16:57:48,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:57:48,300 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:57:48,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-10-13 16:57:48,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb8d7b9/26018ccdd5c84f9094830294d856838d/FLAG354343917 [2024-10-13 16:57:48,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb8d7b9/26018ccdd5c84f9094830294d856838d [2024-10-13 16:57:48,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:57:48,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:57:48,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:48,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:57:48,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:57:48,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cfc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48, skipping insertion in model container [2024-10-13 16:57:48,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:57:48,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:48,494 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:57:48,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:57:48,517 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:57:48,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48 WrapperNode [2024-10-13 16:57:48,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:57:48,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:48,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:57:48,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:57:48,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,536 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-10-13 16:57:48,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:57:48,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:57:48,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:57:48,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:57:48,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,550 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:57:48,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:57:48,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:57:48,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:57:48,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:57:48,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (1/1) ... [2024-10-13 16:57:48,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:48,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:48,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:48,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 16:57:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:57:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:57:48,683 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:57:48,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:57:48,733 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-13 16:57:48,733 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:57:48,740 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:57:48,741 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 16:57:48,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:48 BoogieIcfgContainer [2024-10-13 16:57:48,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:57:48,742 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 16:57:48,742 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 16:57:48,744 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 16:57:48,745 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:48,745 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 04:57:48" (1/3) ... [2024-10-13 16:57:48,746 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aac8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:48, skipping insertion in model container [2024-10-13 16:57:48,746 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:48,746 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:57:48" (2/3) ... [2024-10-13 16:57:48,746 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aac8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 04:57:48, skipping insertion in model container [2024-10-13 16:57:48,746 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 16:57:48,746 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:48" (3/3) ... [2024-10-13 16:57:48,747 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2024-10-13 16:57:48,786 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 16:57:48,786 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 16:57:48,786 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 16:57:48,786 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 16:57:48,786 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 16:57:48,786 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 16:57:48,786 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 16:57:48,786 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 16:57:48,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:48,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:57:48,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:48,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:48,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:57:48,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:48,804 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 16:57:48,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:48,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 16:57:48,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:48,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:48,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:57:48,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:48,811 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2024-10-13 16:57:48,811 INFO L747 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(main_~i~0#1 > 0); 10#L12true assume !(1 == main_~i~0#1); 2#L12-2true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 7#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2024-10-13 16:57:48,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 16:57:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693271940] [2024-10-13 16:57:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:48,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:48,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-10-13 16:57:48,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834275152] [2024-10-13 16:57:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834275152] [2024-10-13 16:57:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834275152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:57:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586943042] [2024-10-13 16:57:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:48,994 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:57:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:57:49,028 INFO L87 Difference]: Start difference. 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:49,051 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-10-13 16:57:49,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-10-13 16:57:49,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 16:57:49,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 15 transitions. [2024-10-13 16:57:49,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 16:57:49,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 16:57:49,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2024-10-13 16:57:49,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:57:49,059 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-13 16:57:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2024-10-13 16:57:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 16:57:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2024-10-13 16:57:49,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-13 16:57:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:57:49,083 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-13 16:57:49,084 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 16:57:49,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2024-10-13 16:57:49,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-13 16:57:49,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:49,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:49,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:57:49,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:49,087 INFO L745 eck$LassoCheckResult]: Stem: 40#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 41#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; 42#L18-1 [2024-10-13 16:57:49,087 INFO L747 eck$LassoCheckResult]: Loop: 42#L18-1 assume !!(main_~i~0#1 > 0); 44#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 35#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 36#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 42#L18-1 [2024-10-13 16:57:49,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-13 16:57:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336690448] [2024-10-13 16:57:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2024-10-13 16:57:49,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518782958] [2024-10-13 16:57:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:49,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518782958] [2024-10-13 16:57:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518782958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:49,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 16:57:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63357066] [2024-10-13 16:57:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:49,145 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:57:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:57:49,146 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:49,176 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2024-10-13 16:57:49,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-10-13 16:57:49,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:49,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2024-10-13 16:57:49,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-13 16:57:49,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-13 16:57:49,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2024-10-13 16:57:49,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 16:57:49,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-13 16:57:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2024-10-13 16:57:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 16:57:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2024-10-13 16:57:49,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-13 16:57:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:57:49,185 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-13 16:57:49,186 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 16:57:49,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2024-10-13 16:57:49,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:49,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:49,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:49,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 16:57:49,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:49,187 INFO L745 eck$LassoCheckResult]: Stem: 69#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 70#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; 72#L18-1 [2024-10-13 16:57:49,187 INFO L747 eck$LassoCheckResult]: Loop: 72#L18-1 assume !!(main_~i~0#1 > 0); 77#L12 assume !(1 == main_~i~0#1); 76#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 71#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 72#L18-1 [2024-10-13 16:57:49,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-13 16:57:49,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659469872] [2024-10-13 16:57:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-10-13 16:57:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037923773] [2024-10-13 16:57:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2024-10-13 16:57:49,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255817648] [2024-10-13 16:57:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,284 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:49,284 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:49,284 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:49,284 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:49,284 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:49,284 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,284 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:49,284 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:49,285 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-10-13 16:57:49,285 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:49,285 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:49,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,439 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:49,440 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:49,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 16:57:49,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,464 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,464 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 16:57:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 16:57:49,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,495 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,495 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 16:57:49,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,525 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:49,526 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:49,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 16:57:49,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 16:57:49,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:49,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,565 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-10-13 16:57:49,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 16:57:49,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:49,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:49,581 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:49,592 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-10-13 16:57:49,592 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:49,592 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:49,593 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:49,593 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:49,593 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:49,593 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,593 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:49,593 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:49,593 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-10-13 16:57:49,593 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:49,593 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:49,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,646 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:49,650 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:49,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 16:57:49,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:49,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:49,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:49,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:49,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 16:57:49,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:49,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:49,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:49,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:49,718 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-10-13 16:57:49,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 16:57:49,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:49,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:49,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:49,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:49,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:49,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:49,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:49,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:49,737 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:49,740 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:49,740 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-13 16:57:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:49,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:49,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 16:57:49,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:49,745 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:49,745 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:49,745 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 16:57:49,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:49,758 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:49,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:49,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:49,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:49,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8. 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 35 states and 51 transitions. Complement of second has 7 states. [2024-10-13 16:57:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-13 16:57:49,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-13 16:57:49,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:49,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-13 16:57:49,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:49,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-13 16:57:49,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:49,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2024-10-13 16:57:49,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2024-10-13 16:57:49,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2024-10-13 16:57:49,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-13 16:57:49,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 16:57:49,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2024-10-13 16:57:49,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:49,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2024-10-13 16:57:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2024-10-13 16:57:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-13 16:57:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-10-13 16:57:49,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-13 16:57:49,880 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-13 16:57:49,880 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 16:57:49,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-10-13 16:57:49,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-13 16:57:49,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:49,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:49,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 16:57:49,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:49,881 INFO L745 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 165#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; 167#L18-1 assume !!(main_~i~0#1 > 0); 161#L12 [2024-10-13 16:57:49,881 INFO L747 eck$LassoCheckResult]: Loop: 161#L12 assume !(1 == main_~i~0#1); 177#L12-2 assume !(10 == main_~i~0#1); 166#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 160#L18-1 assume !!(main_~i~0#1 > 0); 161#L12 [2024-10-13 16:57:49,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-13 16:57:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964314106] [2024-10-13 16:57:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2024-10-13 16:57:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570220754] [2024-10-13 16:57:49,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2024-10-13 16:57:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6793021] [2024-10-13 16:57:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:49,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:49,936 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:49,937 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:49,937 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:49,937 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:49,937 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:49,937 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:49,937 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:49,937 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:49,937 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-10-13 16:57:49,937 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:49,937 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:49,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:49,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,023 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:50,023 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:50,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,025 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 16:57:50,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,045 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,046 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-13 16:57:50,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,059 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 16:57:50,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,083 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-10-13 16:57:50,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,088 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 16:57:50,090 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:50,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,146 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:50,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,151 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:50,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:50,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:50,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:50,151 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:50,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:50,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:50,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-10-13 16:57:50,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:50,151 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:50,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,227 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:50,227 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:50,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,229 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 16:57:50,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:50,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:50,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:50,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:50,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:50,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:50,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:50,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:50,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 16:57:50,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,265 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 16:57:50,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:50,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:50,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:50,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:50,277 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:57:50,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:50,279 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:57:50,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:50,282 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:50,284 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:57:50,284 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,285 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 16:57:50,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:50,287 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:50,287 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:50,287 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 16:57:50,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 16:57:50,298 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:50,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:50,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:50,315 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:50,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:50,338 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:50,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:50,365 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. 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 41 states and 59 transitions. Complement of second has 7 states. [2024-10-13 16:57:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 16:57:50,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-13 16:57:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-13 16:57:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-13 16:57:50,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:50,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-10-13 16:57:50,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:50,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2024-10-13 16:57:50,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-13 16:57:50,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-13 16:57:50,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-10-13 16:57:50,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:50,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-13 16:57:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-10-13 16:57:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 16:57:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-10-13 16:57:50,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-13 16:57:50,375 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-13 16:57:50,375 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 16:57:50,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-10-13 16:57:50,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:50,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:50,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:50,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-13 16:57:50,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:50,377 INFO L745 eck$LassoCheckResult]: Stem: 273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 274#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; 277#L18-1 assume !!(main_~i~0#1 > 0); 280#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 281#L12-2 assume !(10 == main_~i~0#1); 287#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 288#L18-1 [2024-10-13 16:57:50,377 INFO L747 eck$LassoCheckResult]: Loop: 288#L18-1 assume !!(main_~i~0#1 > 0); 295#L12 assume !(1 == main_~i~0#1); 289#L12-2 assume !(10 == main_~i~0#1); 290#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 288#L18-1 [2024-10-13 16:57:50,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2024-10-13 16:57:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870783811] [2024-10-13 16:57:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2024-10-13 16:57:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731651427] [2024-10-13 16:57:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:50,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2024-10-13 16:57:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:50,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722655753] [2024-10-13 16:57:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:50,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:50,425 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:50,425 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:50,425 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:50,425 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:50,425 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:50,426 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,426 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:50,426 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:50,426 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-10-13 16:57:50,426 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:50,426 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:50,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,496 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:50,497 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,498 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 16:57:50,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,523 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-10-13 16:57:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 16:57:50,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:50,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,553 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,553 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=14} Honda state: {ULTIMATE.start_main_~i~0#1=14} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=1}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}] Lambdas: [1, 17, 6] Nus: [1, 0] [2024-10-13 16:57:50,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,565 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 16:57:50,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,583 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,583 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,595 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 16:57:50,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,607 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,608 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,617 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-10-13 16:57:50,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,619 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 16:57:50,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,637 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,637 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,647 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-10-13 16:57:50,670 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:50,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:50,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:50,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:50,670 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:50,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:50,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:50,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-10-13 16:57:50,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:50,670 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:50,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-13 16:57:50,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,772 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:50,772 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,773 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 16:57:50,775 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,775 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,786 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,786 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=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,796 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-10-13 16:57:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,798 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 16:57:50,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,812 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,812 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,822 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-10-13 16:57:50,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,823 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 16:57:50,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,841 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,841 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_6=1} Honda state: {v_rep~unnamed0~0~true_6=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,851 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-10-13 16:57:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,853 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 16:57:50,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,864 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:50,864 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:50,874 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-10-13 16:57:50,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,875 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 16:57:50,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:50,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,897 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-10-13 16:57:50,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:50,898 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:50,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 16:57:50,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:50,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:50,926 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:50,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:50,930 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:50,930 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:50,930 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:50,930 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:50,931 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:50,931 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:50,931 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:50,931 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:50,931 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-10-13 16:57:50,931 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:50,931 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:50,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:50,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:51,022 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:51,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,024 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 16:57:51,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:51,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:51,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:51,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-13 16:57:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,051 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 16:57:51,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:51,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:51,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:51,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:51,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-13 16:57:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,078 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 16:57:51,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:51,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:51,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:51,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,105 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 16:57:51,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:51,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:51,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:51,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:51,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,130 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 16:57:51,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:51,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:51,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:51,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-13 16:57:51,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,156 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 16:57:51,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,167 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:57:51,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,172 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-13 16:57:51,172 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-13 16:57:51,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:51,200 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-13 16:57:51,201 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 16:57:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,202 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 16:57:51,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:51,218 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-10-13 16:57:51,218 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:51,218 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2024-10-13 16:57:51,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,231 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-10-13 16:57:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,276 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:51,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-10-13 16:57:51,312 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-13 16:57:51,312 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 46 states and 68 transitions. Complement of second has 8 states. [2024-10-13 16:57:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-10-13 16:57:51,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-13 16:57:51,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:51,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:57:51,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:51,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-10-13 16:57:51,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:51,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2024-10-13 16:57:51,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:51,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2024-10-13 16:57:51,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-13 16:57:51,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 16:57:51,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2024-10-13 16:57:51,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:51,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-13 16:57:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2024-10-13 16:57:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-10-13 16:57:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2024-10-13 16:57:51,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-10-13 16:57:51,366 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-10-13 16:57:51,367 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 16:57:51,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2024-10-13 16:57:51,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-13 16:57:51,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:51,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:51,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:51,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:51,368 INFO L745 eck$LassoCheckResult]: Stem: 416#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 417#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; 420#L18-1 assume !!(main_~i~0#1 > 0); 429#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 426#L12-2 assume !(10 == main_~i~0#1); 425#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 424#L18-1 assume !!(main_~i~0#1 > 0); 421#L12 assume !(1 == main_~i~0#1); 422#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 447#L15-1 [2024-10-13 16:57:51,368 INFO L747 eck$LassoCheckResult]: Loop: 447#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 446#L18-1 assume !!(main_~i~0#1 > 0); 444#L12 assume !(1 == main_~i~0#1); 445#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 447#L15-1 [2024-10-13 16:57:51,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2024-10-13 16:57:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712562767] [2024-10-13 16:57:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712562767] [2024-10-13 16:57:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712562767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486713872] [2024-10-13 16:57:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,397 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-13 16:57:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:51,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486713872] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:51,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:51,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-13 16:57:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812557095] [2024-10-13 16:57:51,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:51,447 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2024-10-13 16:57:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100567020] [2024-10-13 16:57:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:51,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:51,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:51,484 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:51,484 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:51,484 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:51,484 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:51,484 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:51,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:51,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:51,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-10-13 16:57:51,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:51,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:51,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,528 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:51,529 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:51,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,530 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 16:57:51,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:51,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:51,551 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-10-13 16:57:51,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,553 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 16:57:51,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:51,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:51,565 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:51,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,575 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:51,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:51,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:51,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:51,575 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:51,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,575 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:51,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:51,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-10-13 16:57:51,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:51,576 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:51,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,617 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:51,617 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:51,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,619 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 16:57:51,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:51,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:51,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:51,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:51,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:51,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:51,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:51,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:51,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:51,634 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:57:51,634 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:51,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,635 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 16:57:51,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:51,637 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:51,637 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:51,637 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 16:57:51,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-13 16:57:51,648 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:51,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:51,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:51,689 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:51,689 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 105 states and 160 transitions. Complement of second has 7 states. [2024-10-13 16:57:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-13 16:57:51,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-13 16:57:51,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:51,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2024-10-13 16:57:51,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:51,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2024-10-13 16:57:51,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:51,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2024-10-13 16:57:51,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-13 16:57:51,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2024-10-13 16:57:51,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-13 16:57:51,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-10-13 16:57:51,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2024-10-13 16:57:51,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:51,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-10-13 16:57:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2024-10-13 16:57:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-10-13 16:57:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 81 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-13 16:57:51,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-13 16:57:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:57:51,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:57:51,724 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:51,762 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2024-10-13 16:57:51,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2024-10-13 16:57:51,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-10-13 16:57:51,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2024-10-13 16:57:51,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-10-13 16:57:51,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-10-13 16:57:51,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2024-10-13 16:57:51,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:51,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2024-10-13 16:57:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2024-10-13 16:57:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-10-13 16:57:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 135 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-10-13 16:57:51,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-10-13 16:57:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:57:51,774 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-10-13 16:57:51,774 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 16:57:51,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2024-10-13 16:57:51,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-13 16:57:51,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:51,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:51,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-13 16:57:51,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:51,776 INFO L745 eck$LassoCheckResult]: Stem: 918#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 919#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; 922#L18-1 assume !!(main_~i~0#1 > 0); 933#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 931#L12-2 assume !(10 == main_~i~0#1); 926#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 927#L18-1 assume !!(main_~i~0#1 > 0); 1005#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 979#L12-2 assume !(10 == main_~i~0#1); 1007#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 985#L18-1 [2024-10-13 16:57:51,776 INFO L747 eck$LassoCheckResult]: Loop: 985#L18-1 assume !!(main_~i~0#1 > 0); 995#L12 assume !(1 == main_~i~0#1); 968#L12-2 assume !(10 == main_~i~0#1); 990#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 985#L18-1 [2024-10-13 16:57:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2024-10-13 16:57:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309932147] [2024-10-13 16:57:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309932147] [2024-10-13 16:57:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309932147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:51,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:51,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:57:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211755945] [2024-10-13 16:57:51,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:51,798 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2024-10-13 16:57:51,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:51,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089613811] [2024-10-13 16:57:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:51,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:51,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:51,831 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:51,831 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:51,831 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:51,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:51,832 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:51,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:51,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:51,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-10-13 16:57:51,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:51,832 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:51,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:51,864 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-10-13 16:57:51,876 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-10-13 16:57:51,923 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:51,924 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:51,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,925 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 16:57:51,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:51,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:51,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:51,950 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:51,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 16:57:51,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:51,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:51,983 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:51,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:51,987 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:51,987 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:51,987 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:51,987 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:51,988 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:51,988 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:51,988 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:51,988 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:51,988 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-10-13 16:57:51,988 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:51,988 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:51,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,059 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:52,059 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:52,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,061 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 16:57:52,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:52,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:52,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:52,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:52,073 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:57:52,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:52,074 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:57:52,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:52,076 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:52,077 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:57:52,077 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:52,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,079 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-13 16:57:52,079 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:52,080 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:52,080 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:52,080 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 16:57:52,089 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-10-13 16:57:52,090 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:52,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,114 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,135 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:52,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 248 states and 381 transitions. Complement of second has 5 states. [2024-10-13 16:57:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-13 16:57:52,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-13 16:57:52,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-13 16:57:52,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-13 16:57:52,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2024-10-13 16:57:52,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-13 16:57:52,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2024-10-13 16:57:52,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-10-13 16:57:52,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-10-13 16:57:52,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2024-10-13 16:57:52,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:52,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-10-13 16:57:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2024-10-13 16:57:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2024-10-13 16:57:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.504950495049505) internal successors, (304), 201 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-10-13 16:57:52,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-10-13 16:57:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:52,179 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:52,193 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2024-10-13 16:57:52,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2024-10-13 16:57:52,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-10-13 16:57:52,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2024-10-13 16:57:52,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-10-13 16:57:52,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-13 16:57:52,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2024-10-13 16:57:52,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:52,196 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2024-10-13 16:57:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2024-10-13 16:57:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2024-10-13 16:57:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 200 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-10-13 16:57:52,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-13 16:57:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:52,203 INFO L425 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-13 16:57:52,203 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 16:57:52,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2024-10-13 16:57:52,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-10-13 16:57:52,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:52,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:52,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 16:57:52,204 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 16:57:52,205 INFO L745 eck$LassoCheckResult]: Stem: 1796#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1797#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; 1800#L18-1 assume !!(main_~i~0#1 > 0); 1816#L12 assume !(1 == main_~i~0#1); 1819#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 1818#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1814#L18-1 assume !!(main_~i~0#1 > 0); 1815#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1940#L12-2 assume !(10 == main_~i~0#1); 1824#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1803#L18-1 assume !!(main_~i~0#1 > 0); 1804#L12 assume !(1 == main_~i~0#1); 1986#L12-2 assume !(10 == main_~i~0#1); 1807#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1791#L18-1 [2024-10-13 16:57:52,205 INFO L747 eck$LassoCheckResult]: Loop: 1791#L18-1 assume !!(main_~i~0#1 > 0); 1792#L12 assume !(1 == main_~i~0#1); 1801#L12-2 assume !(10 == main_~i~0#1); 1808#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1791#L18-1 [2024-10-13 16:57:52,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2024-10-13 16:57:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149510203] [2024-10-13 16:57:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:52,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149510203] [2024-10-13 16:57:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149510203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:52,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:52,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:57:52,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657921731] [2024-10-13 16:57:52,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:52,238 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2024-10-13 16:57:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051941820] [2024-10-13 16:57:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:52,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:52,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:52,269 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:52,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:52,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:52,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:52,270 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:52,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:52,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:52,270 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-10-13 16:57:52,270 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:52,270 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:52,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,342 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:52,342 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:52,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,343 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 16:57:52,345 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:52,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:52,363 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:52,363 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:52,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,374 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 16:57:52,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:52,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:52,393 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:52,393 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:52,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 16:57:52,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,403 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 16:57:52,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:52,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:52,421 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:52,422 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:52,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,433 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 16:57:52,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:52,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:52,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,455 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 16:57:52,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:52,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:52,487 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:52,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,491 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:52,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:52,491 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:52,491 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:52,491 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:52,491 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,491 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:52,491 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:52,491 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-10-13 16:57:52,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:52,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:52,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:52,558 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:52,559 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:52,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,560 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 16:57:52,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:52,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:52,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:52,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:52,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:52,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:52,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:52,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:52,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-13 16:57:52,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,586 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 16:57:52,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:52,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:52,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:52,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:52,597 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:57:52,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:52,597 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:57:52,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:52,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:52,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,610 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 16:57:52,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:52,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:52,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:52,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:52,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:52,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:52,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:52,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:52,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,636 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-13 16:57:52,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:52,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:52,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:52,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:52,647 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-13 16:57:52,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:52,648 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-13 16:57:52,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:52,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:52,651 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 16:57:52,651 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:52,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:52,653 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:52,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 16:57:52,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:52,655 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:52,655 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:52,655 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 16:57:52,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,665 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:52,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,710 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,724 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:52,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 280 states and 401 transitions. Complement of second has 5 states. [2024-10-13 16:57:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-13 16:57:52,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-13 16:57:52,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,740 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:52,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,775 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,789 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:52,789 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,804 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 280 states and 401 transitions. Complement of second has 5 states. [2024-10-13 16:57:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-13 16:57:52,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-13 16:57:52,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,806 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:52,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,843 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:52,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,860 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 16:57:52,860 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 334 states and 496 transitions. Complement of second has 4 states. [2024-10-13 16:57:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-10-13 16:57:52,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-13 16:57:52,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2024-10-13 16:57:52,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2024-10-13 16:57:52,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:52,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2024-10-13 16:57:52,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-10-13 16:57:52,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2024-10-13 16:57:52,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-10-13 16:57:52,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-13 16:57:52,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2024-10-13 16:57:52,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:52,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2024-10-13 16:57:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2024-10-13 16:57:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2024-10-13 16:57:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.401197604790419) internal successors, (234), 166 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-10-13 16:57:52,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-10-13 16:57:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:57:52,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:57:52,893 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:52,907 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-10-13 16:57:52,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2024-10-13 16:57:52,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2024-10-13 16:57:52,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2024-10-13 16:57:52,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-10-13 16:57:52,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2024-10-13 16:57:52,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2024-10-13 16:57:52,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:52,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2024-10-13 16:57:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2024-10-13 16:57:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-10-13 16:57:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 169 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2024-10-13 16:57:52,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-10-13 16:57:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:57:52,913 INFO L425 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-10-13 16:57:52,913 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 16:57:52,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2024-10-13 16:57:52,914 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2024-10-13 16:57:52,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:52,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:52,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 16:57:52,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2024-10-13 16:57:52,914 INFO L745 eck$LassoCheckResult]: Stem: 3427#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3428#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; 3432#L18-1 assume !!(main_~i~0#1 > 0); 3546#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3533#L12-2 assume !(10 == main_~i~0#1); 3435#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3436#L18-1 assume !!(main_~i~0#1 > 0); 3553#L12 assume !(1 == main_~i~0#1); 3545#L12-2 assume !(10 == main_~i~0#1); 3543#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3440#L18-1 [2024-10-13 16:57:52,914 INFO L747 eck$LassoCheckResult]: Loop: 3440#L18-1 assume !!(main_~i~0#1 > 0); 3536#L12 assume !(1 == main_~i~0#1); 3474#L12-2 assume !(10 == main_~i~0#1); 3532#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3530#L18-1 assume !!(main_~i~0#1 > 0); 3528#L12 assume !(1 == main_~i~0#1); 3525#L12-2 assume !(10 == main_~i~0#1); 3438#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3440#L18-1 [2024-10-13 16:57:52,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2024-10-13 16:57:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922410893] [2024-10-13 16:57:52,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922410893] [2024-10-13 16:57:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922410893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:52,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:57:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818949825] [2024-10-13 16:57:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:52,941 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:52,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2024-10-13 16:57:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120641068] [2024-10-13 16:57:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:52,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:52,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:52,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-13 16:57:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:57:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120641068] [2024-10-13 16:57:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120641068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:57:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:57:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:57:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555222864] [2024-10-13 16:57:52,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:57:52,968 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:57:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:57:52,968 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. cyclomatic complexity: 73 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:52,973 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-10-13 16:57:52,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2024-10-13 16:57:52,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-13 16:57:52,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2024-10-13 16:57:52,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-10-13 16:57:52,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-10-13 16:57:52,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-10-13 16:57:52,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:52,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-13 16:57:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-10-13 16:57:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-13 16:57:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-10-13 16:57:52,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-13 16:57:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:57:52,980 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-13 16:57:52,980 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 16:57:52,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2024-10-13 16:57:52,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-10-13 16:57:52,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:52,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:52,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2024-10-13 16:57:52,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2024-10-13 16:57:52,982 INFO L745 eck$LassoCheckResult]: Stem: 3709#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3710#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; 3713#L18-1 assume !!(main_~i~0#1 > 0); 3740#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3734#L12-2 assume !(10 == main_~i~0#1); 3733#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3732#L18-1 assume !!(main_~i~0#1 > 0); 3731#L12 assume !(1 == main_~i~0#1); 3730#L12-2 assume !(10 == main_~i~0#1); 3729#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3728#L18-1 assume !!(main_~i~0#1 > 0); 3727#L12 assume !(1 == main_~i~0#1); 3726#L12-2 assume !(10 == main_~i~0#1); 3725#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3724#L18-1 assume !!(main_~i~0#1 > 0); 3721#L12 assume !(1 == main_~i~0#1); 3723#L12-2 assume !(10 == main_~i~0#1); 3722#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3720#L18-1 assume !!(main_~i~0#1 > 0); 3719#L12 assume !(1 == main_~i~0#1); 3718#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3711#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3707#L18-1 assume !!(main_~i~0#1 > 0); 3708#L12 assume !(1 == main_~i~0#1); 3702#L12-2 assume !(10 == main_~i~0#1); 3704#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3712#L18-1 assume !!(main_~i~0#1 > 0); 3714#L12 [2024-10-13 16:57:52,982 INFO L747 eck$LassoCheckResult]: Loop: 3714#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3700#L12-2 assume !(10 == main_~i~0#1); 3701#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3705#L18-1 assume !!(main_~i~0#1 > 0); 3706#L12 assume !(1 == main_~i~0#1); 3781#L12-2 assume !(10 == main_~i~0#1); 3780#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3779#L18-1 assume !!(main_~i~0#1 > 0); 3778#L12 assume !(1 == main_~i~0#1); 3777#L12-2 assume !(10 == main_~i~0#1); 3776#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3775#L18-1 assume !!(main_~i~0#1 > 0); 3774#L12 assume !(1 == main_~i~0#1); 3773#L12-2 assume !(10 == main_~i~0#1); 3748#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3744#L18-1 assume !!(main_~i~0#1 > 0); 3736#L12 assume !(1 == main_~i~0#1); 3737#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3715#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3716#L18-1 assume !!(main_~i~0#1 > 0); 3708#L12 assume !(1 == main_~i~0#1); 3702#L12-2 assume !(10 == main_~i~0#1); 3704#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3712#L18-1 assume !!(main_~i~0#1 > 0); 3714#L12 [2024-10-13 16:57:52,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2024-10-13 16:57:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669960432] [2024-10-13 16:57:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669960432] [2024-10-13 16:57:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669960432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771890792] [2024-10-13 16:57:53,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 16:57:53,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:53,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,044 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-10-13 16:57:53,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 16:57:53,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:53,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:53,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:53,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771890792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:53,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:53,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 16:57:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209366102] [2024-10-13 16:57:53,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:53,152 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 16:57:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2024-10-13 16:57:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670110350] [2024-10-13 16:57:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670110350] [2024-10-13 16:57:53,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670110350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397942666] [2024-10-13 16:57:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,207 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-10-13 16:57:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:53,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 16:57:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397942666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:53,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-13 16:57:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537834587] [2024-10-13 16:57:53,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:53,298 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 16:57:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 16:57:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-13 16:57:53,298 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. cyclomatic complexity: 17 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:53,335 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2024-10-13 16:57:53,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2024-10-13 16:57:53,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-13 16:57:53,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2024-10-13 16:57:53,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-13 16:57:53,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-13 16:57:53,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2024-10-13 16:57:53,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:53,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2024-10-13 16:57:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2024-10-13 16:57:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2024-10-13 16:57:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.0774647887323943) internal successors, (153), 141 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-10-13 16:57:53,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-10-13 16:57:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 16:57:53,339 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-10-13 16:57:53,339 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 16:57:53,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2024-10-13 16:57:53,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2024-10-13 16:57:53,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:53,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:53,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2024-10-13 16:57:53,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2024-10-13 16:57:53,340 INFO L745 eck$LassoCheckResult]: Stem: 4276#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4277#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; 4280#L18-1 assume !!(main_~i~0#1 > 0); 4382#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4268#L12-2 assume !(10 == main_~i~0#1); 4269#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4368#L18-1 assume !!(main_~i~0#1 > 0); 4367#L12 assume !(1 == main_~i~0#1); 4366#L12-2 assume !(10 == main_~i~0#1); 4365#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4364#L18-1 assume !!(main_~i~0#1 > 0); 4363#L12 assume !(1 == main_~i~0#1); 4362#L12-2 assume !(10 == main_~i~0#1); 4361#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4360#L18-1 assume !!(main_~i~0#1 > 0); 4359#L12 assume !(1 == main_~i~0#1); 4358#L12-2 assume !(10 == main_~i~0#1); 4357#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4356#L18-1 assume !!(main_~i~0#1 > 0); 4355#L12 assume !(1 == main_~i~0#1); 4354#L12-2 assume !(10 == main_~i~0#1); 4353#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4352#L18-1 assume !!(main_~i~0#1 > 0); 4351#L12 assume !(1 == main_~i~0#1); 4350#L12-2 assume !(10 == main_~i~0#1); 4349#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4348#L18-1 assume !!(main_~i~0#1 > 0); 4347#L12 assume !(1 == main_~i~0#1); 4346#L12-2 assume !(10 == main_~i~0#1); 4345#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4344#L18-1 assume !!(main_~i~0#1 > 0); 4343#L12 assume !(1 == main_~i~0#1); 4342#L12-2 assume !(10 == main_~i~0#1); 4341#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4340#L18-1 assume !!(main_~i~0#1 > 0); 4290#L12 assume !(1 == main_~i~0#1); 4294#L12-2 assume !(10 == main_~i~0#1); 4291#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4289#L18-1 assume !!(main_~i~0#1 > 0); 4288#L12 assume !(1 == main_~i~0#1); 4287#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4278#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4279#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 assume !(1 == main_~i~0#1); 4338#L12-2 assume !(10 == main_~i~0#1); 4337#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4335#L18-1 assume !!(main_~i~0#1 > 0); 4334#L12 [2024-10-13 16:57:53,341 INFO L747 eck$LassoCheckResult]: Loop: 4334#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4333#L12-2 assume !(10 == main_~i~0#1); 4332#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4331#L18-1 assume !!(main_~i~0#1 > 0); 4330#L12 assume !(1 == main_~i~0#1); 4329#L12-2 assume !(10 == main_~i~0#1); 4328#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4327#L18-1 assume !!(main_~i~0#1 > 0); 4326#L12 assume !(1 == main_~i~0#1); 4325#L12-2 assume !(10 == main_~i~0#1); 4324#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4323#L18-1 assume !!(main_~i~0#1 > 0); 4322#L12 assume !(1 == main_~i~0#1); 4321#L12-2 assume !(10 == main_~i~0#1); 4320#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4319#L18-1 assume !!(main_~i~0#1 > 0); 4318#L12 assume !(1 == main_~i~0#1); 4317#L12-2 assume !(10 == main_~i~0#1); 4316#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4315#L18-1 assume !!(main_~i~0#1 > 0); 4314#L12 assume !(1 == main_~i~0#1); 4313#L12-2 assume !(10 == main_~i~0#1); 4312#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4311#L18-1 assume !!(main_~i~0#1 > 0); 4310#L12 assume !(1 == main_~i~0#1); 4309#L12-2 assume !(10 == main_~i~0#1); 4308#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4307#L18-1 assume !!(main_~i~0#1 > 0); 4306#L12 assume !(1 == main_~i~0#1); 4305#L12-2 assume !(10 == main_~i~0#1); 4304#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4303#L18-1 assume !!(main_~i~0#1 > 0); 4302#L12 assume !(1 == main_~i~0#1); 4301#L12-2 assume !(10 == main_~i~0#1); 4299#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4295#L18-1 assume !!(main_~i~0#1 > 0); 4292#L12 assume !(1 == main_~i~0#1); 4293#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4285#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 assume !(1 == main_~i~0#1); 4338#L12-2 assume !(10 == main_~i~0#1); 4337#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4335#L18-1 assume !!(main_~i~0#1 > 0); 4334#L12 [2024-10-13 16:57:53,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2024-10-13 16:57:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:53,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715623861] [2024-10-13 16:57:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:53,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:53,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2024-10-13 16:57:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338371459] [2024-10-13 16:57:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:53,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:53,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:53,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2024-10-13 16:57:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503220751] [2024-10-13 16:57:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-13 16:57:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503220751] [2024-10-13 16:57:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503220751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135115502] [2024-10-13 16:57:53,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 16:57:53,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,440 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-10-13 16:57:53,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 16:57:53,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:53,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-13 16:57:53,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-13 16:57:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135115502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:53,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:53,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 16:57:53,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609819429] [2024-10-13 16:57:53,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:53,612 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:53,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:53,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:53,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:53,612 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:53,612 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,612 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:53,612 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:53,612 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-10-13 16:57:53,612 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:53,612 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:53,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:53,653 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,654 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-13 16:57:53,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:53,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:53,674 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:53,674 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_14=1} Honda state: {v_rep~unnamed0~0~true_14=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:53,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-13 16:57:53,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,685 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-13 16:57:53,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:53,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:53,704 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:53,704 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_14=0} Honda state: {v_rep~unnamed0~0~false_14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:53,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,715 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-13 16:57:53,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:53,717 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:53,737 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-10-13 16:57:53,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,738 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-13 16:57:53,740 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:53,740 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:53,751 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:53,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:53,761 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:53,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:53,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:53,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:53,761 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:53,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:53,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:53,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-10-13 16:57:53,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:53,761 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:53,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:53,805 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:53,805 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:53,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,806 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-13 16:57:53,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:53,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:53,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:53,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:53,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:53,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:53,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:53,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:53,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-13 16:57:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,831 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-13 16:57:53,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:53,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:53,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:53,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:53,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:53,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:53,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:53,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:53,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-13 16:57:53,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,857 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-13 16:57:53,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:53,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:53,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:53,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:53,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:53,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:53,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:53,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:53,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:53,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:53,872 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:53,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:53,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:53,873 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:53,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-13 16:57:53,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:53,875 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:53,875 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:53,875 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2024-10-13 16:57:53,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-13 16:57:53,885 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:53,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:53,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:53,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:54,042 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-13 16:57:54,042 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,076 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 228 states and 242 transitions. Complement of second has 7 states. [2024-10-13 16:57:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 16:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-13 16:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,077 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:54,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:54,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-13 16:57:54,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 238 states and 253 transitions. Complement of second has 11 states. [2024-10-13 16:57:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 16:57:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-13 16:57:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,285 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:54,416 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 5 loop predicates [2024-10-13 16:57:54,417 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,443 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 268 states and 284 transitions. Complement of second has 9 states. [2024-10-13 16:57:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-13 16:57:54,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-13 16:57:54,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,445 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:54,601 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 5 loop predicates [2024-10-13 16:57:54,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 380 states and 401 transitions. Complement of second has 19 states. [2024-10-13 16:57:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-13 16:57:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-13 16:57:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,647 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:54,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:57:54,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:54,791 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-13 16:57:54,792 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:54,942 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 1899 states and 2480 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2024-10-13 16:57:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2024-10-13 16:57:54,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-13 16:57:54,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2024-10-13 16:57:54,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2024-10-13 16:57:54,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:54,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2024-10-13 16:57:54,961 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2024-10-13 16:57:54,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2024-10-13 16:57:54,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-10-13 16:57:54,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2024-10-13 16:57:54,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2024-10-13 16:57:54,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:54,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2024-10-13 16:57:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2024-10-13 16:57:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2024-10-13 16:57:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 564 states have (on average 1.3953900709219857) internal successors, (787), 563 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2024-10-13 16:57:54,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2024-10-13 16:57:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 16:57:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:57:54,971 INFO L87 Difference]: Start difference. First operand 564 states and 787 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:55,004 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2024-10-13 16:57:55,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2024-10-13 16:57:55,007 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2024-10-13 16:57:55,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2024-10-13 16:57:55,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-10-13 16:57:55,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-10-13 16:57:55,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2024-10-13 16:57:55,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:55,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2024-10-13 16:57:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2024-10-13 16:57:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2024-10-13 16:57:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.411671924290221) internal successors, (895), 633 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2024-10-13 16:57:55,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-10-13 16:57:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 16:57:55,016 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-10-13 16:57:55,016 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 16:57:55,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2024-10-13 16:57:55,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2024-10-13 16:57:55,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:55,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:55,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2024-10-13 16:57:55,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2024-10-13 16:57:55,019 INFO L745 eck$LassoCheckResult]: Stem: 10858#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10859#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; 10863#L18-1 assume !!(main_~i~0#1 > 0); 11194#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11045#L12-2 assume !(10 == main_~i~0#1); 11186#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11185#L18-1 assume !!(main_~i~0#1 > 0); 11183#L12 assume !(1 == main_~i~0#1); 11181#L12-2 assume !(10 == main_~i~0#1); 11179#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11177#L18-1 assume !!(main_~i~0#1 > 0); 11175#L12 assume !(1 == main_~i~0#1); 11173#L12-2 assume !(10 == main_~i~0#1); 11171#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11169#L18-1 assume !!(main_~i~0#1 > 0); 11167#L12 assume !(1 == main_~i~0#1); 11165#L12-2 assume !(10 == main_~i~0#1); 11163#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11161#L18-1 assume !!(main_~i~0#1 > 0); 11159#L12 assume !(1 == main_~i~0#1); 11157#L12-2 assume !(10 == main_~i~0#1); 11155#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11153#L18-1 assume !!(main_~i~0#1 > 0); 11151#L12 assume !(1 == main_~i~0#1); 11149#L12-2 assume !(10 == main_~i~0#1); 11147#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11145#L18-1 assume !!(main_~i~0#1 > 0); 11143#L12 assume !(1 == main_~i~0#1); 11141#L12-2 assume !(10 == main_~i~0#1); 11139#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11137#L18-1 assume !!(main_~i~0#1 > 0); 11135#L12 assume !(1 == main_~i~0#1); 11133#L12-2 assume !(10 == main_~i~0#1); 11131#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11127#L18-1 assume !!(main_~i~0#1 > 0); 11125#L12 assume !(1 == main_~i~0#1); 11123#L12-2 assume !(10 == main_~i~0#1); 11119#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11120#L18-1 assume !!(main_~i~0#1 > 0); 11128#L12 assume !(1 == main_~i~0#1); 11111#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11070#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11109#L18-1 assume !!(main_~i~0#1 > 0); 11108#L12 assume !(1 == main_~i~0#1); 11107#L12-2 assume !(10 == main_~i~0#1); 11105#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11104#L18-1 assume !!(main_~i~0#1 > 0); 11103#L12 assume !(1 == main_~i~0#1); 11102#L12-2 assume !(10 == main_~i~0#1); 11100#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11099#L18-1 assume !!(main_~i~0#1 > 0); 11098#L12 assume !(1 == main_~i~0#1); 11097#L12-2 assume !(10 == main_~i~0#1); 11095#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11094#L18-1 assume !!(main_~i~0#1 > 0); 11093#L12 assume !(1 == main_~i~0#1); 11092#L12-2 assume !(10 == main_~i~0#1); 11090#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11089#L18-1 assume !!(main_~i~0#1 > 0); 11042#L12 assume !(1 == main_~i~0#1); 11069#L12-2 assume !(10 == main_~i~0#1); 11046#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11047#L18-1 assume !!(main_~i~0#1 > 0); 11190#L12 [2024-10-13 16:57:55,019 INFO L747 eck$LassoCheckResult]: Loop: 11190#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11187#L12-2 assume !(10 == main_~i~0#1); 10867#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10868#L18-1 assume !!(main_~i~0#1 > 0); 10855#L12 assume !(1 == main_~i~0#1); 10865#L12-2 assume !(10 == main_~i~0#1); 11481#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11479#L18-1 assume !!(main_~i~0#1 > 0); 11477#L12 assume !(1 == main_~i~0#1); 11475#L12-2 assume !(10 == main_~i~0#1); 11473#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11471#L18-1 assume !!(main_~i~0#1 > 0); 11469#L12 assume !(1 == main_~i~0#1); 11467#L12-2 assume !(10 == main_~i~0#1); 11465#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11463#L18-1 assume !!(main_~i~0#1 > 0); 11461#L12 assume !(1 == main_~i~0#1); 11459#L12-2 assume !(10 == main_~i~0#1); 11457#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11455#L18-1 assume !!(main_~i~0#1 > 0); 11453#L12 assume !(1 == main_~i~0#1); 11451#L12-2 assume !(10 == main_~i~0#1); 11449#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11447#L18-1 assume !!(main_~i~0#1 > 0); 11445#L12 assume !(1 == main_~i~0#1); 11443#L12-2 assume !(10 == main_~i~0#1); 11441#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11439#L18-1 assume !!(main_~i~0#1 > 0); 11437#L12 assume !(1 == main_~i~0#1); 11435#L12-2 assume !(10 == main_~i~0#1); 11433#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11431#L18-1 assume !!(main_~i~0#1 > 0); 11430#L12 assume !(1 == main_~i~0#1); 11429#L12-2 assume !(10 == main_~i~0#1); 11425#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11426#L18-1 assume !!(main_~i~0#1 > 0); 11418#L12 assume !(1 == main_~i~0#1); 11419#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11292#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11416#L18-1 assume !!(main_~i~0#1 > 0); 11415#L12 assume !(1 == main_~i~0#1); 11414#L12-2 assume !(10 == main_~i~0#1); 11413#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11412#L18-1 assume !!(main_~i~0#1 > 0); 11411#L12 assume !(1 == main_~i~0#1); 11410#L12-2 assume !(10 == main_~i~0#1); 11409#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11408#L18-1 assume !!(main_~i~0#1 > 0); 11407#L12 assume !(1 == main_~i~0#1); 11368#L12-2 assume !(10 == main_~i~0#1); 11367#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11364#L18-1 assume !!(main_~i~0#1 > 0); 11365#L12 assume !(1 == main_~i~0#1); 11372#L12-2 assume !(10 == main_~i~0#1); 11370#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11371#L18-1 assume !!(main_~i~0#1 > 0); 11356#L12 assume !(1 == main_~i~0#1); 11352#L12-2 assume !(10 == main_~i~0#1); 11293#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11424#L18-1 assume !!(main_~i~0#1 > 0); 11190#L12 [2024-10-13 16:57:55,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2024-10-13 16:57:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868019007] [2024-10-13 16:57:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:55,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:55,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:55,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2024-10-13 16:57:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:55,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301133010] [2024-10-13 16:57:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:55,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:55,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2024-10-13 16:57:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658519179] [2024-10-13 16:57:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-13 16:57:55,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:57:55,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658519179] [2024-10-13 16:57:55,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658519179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 16:57:55,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683440990] [2024-10-13 16:57:55,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 16:57:55,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 16:57:55,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,153 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-10-13 16:57:55,199 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-10-13 16:57:55,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 16:57:55,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 16:57:55,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-13 16:57:55,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 16:57:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2024-10-13 16:57:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683440990] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 16:57:55,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 16:57:55,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-10-13 16:57:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21883494] [2024-10-13 16:57:55,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 16:57:55,479 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:55,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:55,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:55,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:55,480 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-13 16:57:55,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:55,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:55,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-10-13 16:57:55,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:55,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:55,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,516 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:55,516 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-13 16:57:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,518 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-13 16:57:55,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,538 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:55,539 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:55,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-13 16:57:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,550 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-13 16:57:55,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,562 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-13 16:57:55,562 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-13 16:57:55,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,573 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-13 16:57:55,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-13 16:57:55,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-13 16:57:55,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,595 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-13 16:57:55,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-13 16:57:55,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-13 16:57:55,607 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-13 16:57:55,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-13 16:57:55,617 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 16:57:55,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 16:57:55,617 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 16:57:55,617 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 16:57:55,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 16:57:55,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 16:57:55,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 16:57:55,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-10-13 16:57:55,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 16:57:55,618 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 16:57:55,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 16:57:55,654 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 16:57:55,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 16:57:55,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,656 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-13 16:57:55,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:55,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:55,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:55,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:55,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:55,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 16:57:55,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 16:57:55,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:55,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,681 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-13 16:57:55,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:55,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:55,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:55,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:55,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:55,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:55,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:55,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:55,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 16:57:55,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,707 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-13 16:57:55,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 16:57:55,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 16:57:55,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 16:57:55,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 16:57:55,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 16:57:55,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 16:57:55,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 16:57:55,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 16:57:55,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 16:57:55,721 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 16:57:55,721 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 16:57:55,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 16:57:55,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:57:55,722 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 16:57:55,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-13 16:57:55,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 16:57:55,723 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 16:57:55,723 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 16:57:55,723 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2024-10-13 16:57:55,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-13 16:57:55,733 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-13 16:57:55,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:55,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:55,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:55,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:55,963 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-13 16:57:55,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:55,990 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1120 states and 1472 transitions. Complement of second has 7 states. [2024-10-13 16:57:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 16:57:55,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-13 16:57:55,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:55,991 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:56,210 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-13 16:57:56,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:56,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:56,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1179 states and 1565 transitions. Complement of second has 11 states. [2024-10-13 16:57:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 16:57:56,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-13 16:57:56,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:56,270 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:56,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:56,507 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-13 16:57:56,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:56,533 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1301 states and 1787 transitions. Complement of second has 9 states. [2024-10-13 16:57:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-13 16:57:56,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-13 16:57:56,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:56,534 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:56,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:56,765 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-13 16:57:56,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:56,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1866 states and 2535 transitions. Complement of second has 19 states. [2024-10-13 16:57:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-13 16:57:56,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-13 16:57:56,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:56,817 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 16:57:56,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:57:56,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 16:57:56,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:57:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-13 16:57:57,049 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-13 16:57:57,049 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:57,392 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 11129 states and 19734 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2024-10-13 16:57:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2024-10-13 16:57:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2024-10-13 16:57:57,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-13 16:57:57,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:57,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2024-10-13 16:57:57,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:57,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2024-10-13 16:57:57,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 16:57:57,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2024-10-13 16:57:57,480 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2024-10-13 16:57:57,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2024-10-13 16:57:57,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2024-10-13 16:57:57,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2024-10-13 16:57:57,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2024-10-13 16:57:57,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:57,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2024-10-13 16:57:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2024-10-13 16:57:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2024-10-13 16:57:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3014 states have (on average 1.813868613138686) internal successors, (5467), 3013 states have internal predecessors, (5467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2024-10-13 16:57:57,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2024-10-13 16:57:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:57:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 16:57:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-13 16:57:57,543 INFO L87 Difference]: Start difference. First operand 3014 states and 5467 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:57:57,595 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2024-10-13 16:57:57,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2024-10-13 16:57:57,612 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2024-10-13 16:57:57,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2024-10-13 16:57:57,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-10-13 16:57:57,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-10-13 16:57:57,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2024-10-13 16:57:57,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 16:57:57,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2024-10-13 16:57:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2024-10-13 16:57:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2024-10-13 16:57:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3222 states have (on average 1.8395406579764122) internal successors, (5927), 3221 states have internal predecessors, (5927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:57:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2024-10-13 16:57:57,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-10-13 16:57:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 16:57:57,668 INFO L425 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-10-13 16:57:57,668 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 16:57:57,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2024-10-13 16:57:57,676 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2024-10-13 16:57:57,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 16:57:57,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 16:57:57,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2024-10-13 16:57:57,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2024-10-13 16:57:57,679 INFO L745 eck$LassoCheckResult]: Stem: 37489#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37490#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; 37494#L18-1 assume !!(main_~i~0#1 > 0); 37746#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 39008#L12-2 assume !(10 == main_~i~0#1); 39006#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 39004#L18-1 assume !!(main_~i~0#1 > 0); 39002#L12 assume !(1 == main_~i~0#1); 39000#L12-2 assume !(10 == main_~i~0#1); 38998#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38996#L18-1 assume !!(main_~i~0#1 > 0); 38994#L12 assume !(1 == main_~i~0#1); 38992#L12-2 assume !(10 == main_~i~0#1); 38990#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38988#L18-1 assume !!(main_~i~0#1 > 0); 38986#L12 assume !(1 == main_~i~0#1); 38984#L12-2 assume !(10 == main_~i~0#1); 38982#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38980#L18-1 assume !!(main_~i~0#1 > 0); 38978#L12 assume !(1 == main_~i~0#1); 38976#L12-2 assume !(10 == main_~i~0#1); 38974#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38972#L18-1 assume !!(main_~i~0#1 > 0); 38970#L12 assume !(1 == main_~i~0#1); 38968#L12-2 assume !(10 == main_~i~0#1); 38966#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38964#L18-1 assume !!(main_~i~0#1 > 0); 38962#L12 assume !(1 == main_~i~0#1); 38960#L12-2 assume !(10 == main_~i~0#1); 38958#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38956#L18-1 assume !!(main_~i~0#1 > 0); 38954#L12 assume !(1 == main_~i~0#1); 38952#L12-2 assume !(10 == main_~i~0#1); 38950#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38948#L18-1 assume !!(main_~i~0#1 > 0); 38941#L12 assume !(1 == main_~i~0#1); 38944#L12-2 assume !(10 == main_~i~0#1); 38945#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 38939#L18-1 assume !!(main_~i~0#1 > 0); 38940#L12 assume !(1 == main_~i~0#1); 38717#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 38331#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38693#L18-1 assume !!(main_~i~0#1 > 0); 38687#L12 assume !(1 == main_~i~0#1); 38685#L12-2 assume !(10 == main_~i~0#1); 38682#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38678#L18-1 assume !!(main_~i~0#1 > 0); 38674#L12 assume !(1 == main_~i~0#1); 38670#L12-2 assume !(10 == main_~i~0#1); 38667#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38662#L18-1 assume !!(main_~i~0#1 > 0); 38663#L12 assume !(1 == main_~i~0#1); 38655#L12-2 assume !(10 == main_~i~0#1); 38650#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38645#L18-1 assume !!(main_~i~0#1 > 0); 38646#L12 assume !(1 == main_~i~0#1); 38631#L12-2 assume !(10 == main_~i~0#1); 38632#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38695#L18-1 assume !!(main_~i~0#1 > 0); 38694#L12 assume !(1 == main_~i~0#1); 38616#L12-2 assume !(10 == main_~i~0#1); 38615#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38707#L18-1 assume !!(main_~i~0#1 > 0); 38604#L12 assume !(1 == main_~i~0#1); 38599#L12-2 assume !(10 == main_~i~0#1); 38600#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38714#L18-1 assume !!(main_~i~0#1 > 0); 38709#L12 assume !(1 == main_~i~0#1); 38586#L12-2 assume !(10 == main_~i~0#1); 38587#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 38901#L18-1 assume !!(main_~i~0#1 > 0); 38321#L12 assume !(1 == main_~i~0#1); 39857#L12-2 assume !(10 == main_~i~0#1); 39855#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40135#L18-1 assume !!(main_~i~0#1 > 0); 37502#L12 [2024-10-13 16:57:57,679 INFO L747 eck$LassoCheckResult]: Loop: 37502#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37480#L12-2 assume !(10 == main_~i~0#1); 37481#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40643#L18-1 assume !!(main_~i~0#1 > 0); 37495#L12 assume !(1 == main_~i~0#1); 37496#L12-2 assume !(10 == main_~i~0#1); 40675#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40674#L18-1 assume !!(main_~i~0#1 > 0); 40673#L12 assume !(1 == main_~i~0#1); 40672#L12-2 assume !(10 == main_~i~0#1); 40671#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40670#L18-1 assume !!(main_~i~0#1 > 0); 40669#L12 assume !(1 == main_~i~0#1); 40668#L12-2 assume !(10 == main_~i~0#1); 40667#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40666#L18-1 assume !!(main_~i~0#1 > 0); 40665#L12 assume !(1 == main_~i~0#1); 40664#L12-2 assume !(10 == main_~i~0#1); 40663#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40662#L18-1 assume !!(main_~i~0#1 > 0); 40661#L12 assume !(1 == main_~i~0#1); 40660#L12-2 assume !(10 == main_~i~0#1); 40659#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40658#L18-1 assume !!(main_~i~0#1 > 0); 40657#L12 assume !(1 == main_~i~0#1); 40656#L12-2 assume !(10 == main_~i~0#1); 40655#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40654#L18-1 assume !!(main_~i~0#1 > 0); 40653#L12 assume !(1 == main_~i~0#1); 40652#L12-2 assume !(10 == main_~i~0#1); 40651#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40650#L18-1 assume !!(main_~i~0#1 > 0); 40649#L12 assume !(1 == main_~i~0#1); 40648#L12-2 assume !(10 == main_~i~0#1); 40641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40642#L18-1 assume !!(main_~i~0#1 > 0); 40461#L12 assume !(1 == main_~i~0#1); 40462#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 39577#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40435#L18-1 assume !!(main_~i~0#1 > 0); 40432#L12 assume !(1 == main_~i~0#1); 40429#L12-2 assume !(10 == main_~i~0#1); 40426#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40425#L18-1 assume !!(main_~i~0#1 > 0); 40424#L12 assume !(1 == main_~i~0#1); 40422#L12-2 assume !(10 == main_~i~0#1); 40419#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40415#L18-1 assume !!(main_~i~0#1 > 0); 40416#L12 assume !(1 == main_~i~0#1); 40405#L12-2 assume !(10 == main_~i~0#1); 40406#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40397#L18-1 assume !!(main_~i~0#1 > 0); 40398#L12 assume !(1 == main_~i~0#1); 40384#L12-2 assume !(10 == main_~i~0#1); 40380#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40373#L18-1 assume !!(main_~i~0#1 > 0); 40374#L12 assume !(1 == main_~i~0#1); 40362#L12-2 assume !(10 == main_~i~0#1); 40358#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40359#L18-1 assume !!(main_~i~0#1 > 0); 40353#L12 assume !(1 == main_~i~0#1); 40348#L12-2 assume !(10 == main_~i~0#1); 40349#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40455#L18-1 assume !!(main_~i~0#1 > 0); 40454#L12 assume !(1 == main_~i~0#1); 40336#L12-2 assume !(10 == main_~i~0#1); 39625#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 39626#L18-1 assume !!(main_~i~0#1 > 0); 40497#L12 assume !(1 == main_~i~0#1); 39582#L12-2 assume !(10 == main_~i~0#1); 39314#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 39315#L18-1 assume !!(main_~i~0#1 > 0); 37502#L12 [2024-10-13 16:57:57,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2024-10-13 16:57:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261289015] [2024-10-13 16:57:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:57,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:57,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2024-10-13 16:57:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701956306] [2024-10-13 16:57:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:57,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:57,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:57:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2024-10-13 16:57:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:57:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371206709] [2024-10-13 16:57:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:57:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:57:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:57,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:57,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 16:57:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:58,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 16:57:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 16:57:58,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 04:57:58 BoogieIcfgContainer [2024-10-13 16:57:58,292 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 16:57:58,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:57:58,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:57:58,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:57:58,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:57:48" (3/4) ... [2024-10-13 16:57:58,294 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-13 16:57:58,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 16:57:58,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 16:57:58,338 INFO L158 Benchmark]: Toolchain (without parser) took 9998.19ms. Allocated memory was 117.4MB in the beginning and 239.1MB in the end (delta: 121.6MB). Free memory was 88.0MB in the beginning and 97.5MB in the end (delta: -9.5MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2024-10-13 16:57:58,338 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 117.4MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:57:58,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.39ms. Allocated memory was 117.4MB in the beginning and 165.7MB in the end (delta: 48.2MB). Free memory was 87.8MB in the beginning and 129.7MB in the end (delta: -41.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 16:57:58,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.22ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 128.9MB in the end (delta: 779.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:57:58,339 INFO L158 Benchmark]: Boogie Preprocessor took 19.40ms. Allocated memory is still 165.7MB. Free memory was 128.3MB in the beginning and 127.5MB in the end (delta: 848.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:57:58,339 INFO L158 Benchmark]: RCFGBuilder took 184.45ms. Allocated memory is still 165.7MB. Free memory was 127.5MB in the beginning and 117.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 16:57:58,339 INFO L158 Benchmark]: BuchiAutomizer took 9550.14ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 117.8MB in the beginning and 102.8MB in the end (delta: 15.1MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-10-13 16:57:58,339 INFO L158 Benchmark]: Witness Printer took 45.73ms. Allocated memory is still 239.1MB. Free memory was 102.8MB in the beginning and 97.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:57:58,340 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.53ms. Allocated memory is still 117.4MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.39ms. Allocated memory was 117.4MB in the beginning and 165.7MB in the end (delta: 48.2MB). Free memory was 87.8MB in the beginning and 129.7MB in the end (delta: -41.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.22ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 128.9MB in the end (delta: 779.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.40ms. Allocated memory is still 165.7MB. Free memory was 128.3MB in the beginning and 127.5MB in the end (delta: 848.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 184.45ms. Allocated memory is still 165.7MB. Free memory was 127.5MB in the beginning and 117.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9550.14ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 117.8MB in the beginning and 102.8MB in the end (delta: 15.1MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 45.73ms. Allocated memory is still 239.1MB. Free memory was 102.8MB in the beginning and 97.5MB in the end (delta: 5.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 17 terminating modules (9 trivial, 5 deterministic, 3 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i 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) + 21) and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 9) and consists of 9 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 5) and consists of 13 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 3222 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 5.3s. Construction of modules took 0.4s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2653 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 570/640 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 742 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 203 mSDtfsCounter, 742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI2 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax177 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf93 smp89 dnf132 smp95 tf108 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 63ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: 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 i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: 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 i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-13 16:57:58,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2024-10-13 16:57:58,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:58,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:58,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-10-13 16:57:59,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-10-13 16:57:59,368 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)