./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:14:18,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:14:18,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:14:18,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:14:18,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:14:18,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:14:18,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:14:18,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:14:18,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:14:18,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:14:18,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:14:18,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:14:18,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:14:18,594 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:14:18,594 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:14:18,594 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:14:18,595 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:14:18,596 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:14:18,596 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:14:18,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:14:18,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:14:18,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:14:18,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:14:18,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:14:18,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:14:18,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:14:18,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:14:18,598 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:14:18,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:14:18,598 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:14:18,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:14:18,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:14:18,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:14:18,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:14:18,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:14:18,600 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:14:18,600 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2024-10-12 00:14:18,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:14:18,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:14:18,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:14:18,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:14:18,912 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:14:18,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-10-12 00:14:20,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:14:20,501 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:14:20,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2024-10-12 00:14:20,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ecf5fefea/48844febdd974e5da270cc9a40b2436a/FLAG562dc8371 [2024-10-12 00:14:20,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ecf5fefea/48844febdd974e5da270cc9a40b2436a [2024-10-12 00:14:20,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:14:20,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:14:20,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:14:20,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:14:20,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:14:20,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:14:20" (1/1) ... [2024-10-12 00:14:20,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b00fe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:20, skipping insertion in model container [2024-10-12 00:14:20,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:14:20" (1/1) ... [2024-10-12 00:14:20,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:14:21,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:14:21,076 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:14:21,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:14:21,099 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:14:21,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21 WrapperNode [2024-10-12 00:14:21,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:14:21,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:14:21,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:14:21,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:14:21,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,127 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-10-12 00:14:21,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:14:21,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:14:21,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:14:21,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:14:21,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,143 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-12 00:14:21,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:14:21,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:14:21,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:14:21,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:14:21,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (1/1) ... [2024-10-12 00:14:21,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:21,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:21,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:21,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:14:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:14:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:14:21,288 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:14:21,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:14:21,342 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-12 00:14:21,343 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:14:21,354 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:14:21,355 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:14:21,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:14:21 BoogieIcfgContainer [2024-10-12 00:14:21,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:14:21,356 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:14:21,356 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:14:21,360 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:14:21,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:14:21,361 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:14:20" (1/3) ... [2024-10-12 00:14:21,362 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e21afab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:14:21, skipping insertion in model container [2024-10-12 00:14:21,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:14:21,362 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:21" (2/3) ... [2024-10-12 00:14:21,362 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e21afab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:14:21, skipping insertion in model container [2024-10-12 00:14:21,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:14:21,363 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:14:21" (3/3) ... [2024-10-12 00:14:21,364 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2024-10-12 00:14:21,412 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:14:21,412 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:14:21,412 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:14:21,412 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:14:21,413 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:14:21,413 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:14:21,413 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:14:21,413 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:14:21,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:14:21,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:14:21,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:21,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:21,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:21,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:21,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:14:21,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:14:21,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:14:21,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:21,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:21,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:21,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:21,449 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2024-10-12 00:14:21,450 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-12 00:14:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:14:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608487612] [2024-10-12 00:14:21,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:21,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2024-10-12 00:14:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700717938] [2024-10-12 00:14:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700717938] [2024-10-12 00:14:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700717938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:14:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885523935] [2024-10-12 00:14:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:21,720 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:14:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:14:21,754 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-12 00:14:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:21,776 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2024-10-12 00:14:21,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-10-12 00:14:21,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:14:21,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 15 transitions. [2024-10-12 00:14:21,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:14:21,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:14:21,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2024-10-12 00:14:21,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:21,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-12 00:14:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2024-10-12 00:14:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-12 00:14:21,804 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-12 00:14:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2024-10-12 00:14:21,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-12 00:14:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:14:21,812 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2024-10-12 00:14:21,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:14:21,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2024-10-12 00:14:21,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:14:21,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:21,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:21,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:21,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:21,817 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-12 00:14:21,817 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-12 00:14:21,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,818 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:14:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145068636] [2024-10-12 00:14:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2024-10-12 00:14:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875004078] [2024-10-12 00:14:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:21,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875004078] [2024-10-12 00:14:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875004078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:21,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:21,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:14:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695135825] [2024-10-12 00:14:21,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:21,871 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:14:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:14:21,875 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-12 00:14:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:21,897 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2024-10-12 00:14:21,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2024-10-12 00:14:21,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:21,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2024-10-12 00:14:21,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:14:21,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:14:21,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2024-10-12 00:14:21,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:21,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-12 00:14:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2024-10-12 00:14:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-12 00:14:21,903 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-12 00:14:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2024-10-12 00:14:21,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-12 00:14:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:14:21,905 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2024-10-12 00:14:21,905 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:14:21,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2024-10-12 00:14:21,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:21,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:21,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:21,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:21,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:21,907 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-12 00:14:21,907 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-12 00:14:21,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,907 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:14:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774821331] [2024-10-12 00:14:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:21,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2024-10-12 00:14:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294348732] [2024-10-12 00:14:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:21,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2024-10-12 00:14:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:21,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532375737] [2024-10-12 00:14:21,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:21,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:22,006 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:22,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:22,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:22,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:22,006 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:22,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,007 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:22,007 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:22,007 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-10-12 00:14:22,007 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:22,007 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:22,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,125 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:22,126 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:14:22,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:22,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,149 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:22,149 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:22,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:14:22,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:14:22,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:22,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,182 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:22,183 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:22,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:22,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:14:22,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:22,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,226 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:22,227 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:22,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:14:22,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:14:22,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:22,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:14:22,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:22,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,304 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:22,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:22,321 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:22,321 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:22,321 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:22,321 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:22,321 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:22,321 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,321 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:22,321 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:22,321 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2024-10-12 00:14:22,321 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:22,321 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:22,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:22,401 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:22,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:14:22,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:22,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:22,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:22,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:22,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:22,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:22,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:22,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:22,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:14:22,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:14:22,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:22,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:22,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:22,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:22,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:22,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:22,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:22,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:22,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:14:22,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:14:22,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:22,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:22,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:22,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:22,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:22,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:22,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:22,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:22,510 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:22,517 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:22,518 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:14:22,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:14:22,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:22,544 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:22,544 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:22,545 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:14:22,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:22,559 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:22,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:22,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:22,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:22,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:22,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:22,627 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:22,628 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-12 00:14:22,677 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-12 00:14:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:14:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-12 00:14:22,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:14:22,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:22,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-12 00:14:22,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:22,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-12 00:14:22,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:22,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2024-10-12 00:14:22,685 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2024-10-12 00:14:22,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2024-10-12 00:14:22,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-12 00:14:22,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-12 00:14:22,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2024-10-12 00:14:22,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:22,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2024-10-12 00:14:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2024-10-12 00:14:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-12 00:14:22,694 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-12 00:14:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-10-12 00:14:22,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-12 00:14:22,694 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-12 00:14:22,695 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:14:22,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2024-10-12 00:14:22,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2024-10-12 00:14:22,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:22,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:22,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:14:22,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:22,698 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-12 00:14:22,698 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-12 00:14:22,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-12 00:14:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677024338] [2024-10-12 00:14:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:22,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:22,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:22,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2024-10-12 00:14:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263211919] [2024-10-12 00:14:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:22,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:22,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:22,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2024-10-12 00:14:22,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906856680] [2024-10-12 00:14:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:22,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:22,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:22,799 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:22,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:22,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:22,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:22,800 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:22,800 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,800 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:22,800 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:22,800 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-10-12 00:14:22,800 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:22,800 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:22,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:22,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:22,912 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:14:22,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:22,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,939 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:22,939 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:22,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:14:22,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:14:22,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:22,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:22,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:22,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:22,997 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:22,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:14:22,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:23,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:23,077 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:23,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:14:23,084 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:23,084 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:23,084 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:23,084 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:23,084 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:23,084 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,084 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:23,084 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:23,084 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2024-10-12 00:14:23,084 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:23,084 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:23,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,182 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:23,182 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,185 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:14:23,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:23,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:23,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:23,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:23,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:23,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:23,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:23,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:23,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:23,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,226 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:14:23,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:23,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:23,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:23,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:23,241 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:14:23,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:23,243 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:14:23,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:23,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:23,291 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:14:23,291 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,298 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:14:23,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:14:23,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:23,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:23,317 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:23,317 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:14:23,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:14:23,360 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:23,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:23,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:23,397 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:23,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:23,435 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:23,436 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-12 00:14:23,472 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-12 00:14:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:14:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:14:23,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2024-10-12 00:14:23,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:23,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2024-10-12 00:14:23,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:23,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2024-10-12 00:14:23,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:23,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2024-10-12 00:14:23,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:23,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2024-10-12 00:14:23,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:14:23,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-10-12 00:14:23,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2024-10-12 00:14:23,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:23,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-12 00:14:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2024-10-12 00:14:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 00:14:23,488 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-12 00:14:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2024-10-12 00:14:23,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-12 00:14:23,492 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2024-10-12 00:14:23,493 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:14:23,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2024-10-12 00:14:23,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:23,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:23,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:23,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:23,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:23,494 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-12 00:14:23,494 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-12 00:14:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2024-10-12 00:14:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389526687] [2024-10-12 00:14:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2024-10-12 00:14:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720978052] [2024-10-12 00:14:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:23,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2024-10-12 00:14:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911860165] [2024-10-12 00:14:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:23,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:23,569 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:23,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:23,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:23,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:23,570 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:23,570 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,570 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:23,570 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:23,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2024-10-12 00:14:23,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:23,571 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:23,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:23,678 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,680 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:14:23,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:23,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:23,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:14:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,713 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:14:23,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:23,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:23,750 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:23,751 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-12 00:14:23,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:14:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,768 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:14:23,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:23,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:23,793 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:23,793 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-12 00:14:23,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:14:23,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,811 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:14:23,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:23,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:23,831 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:23,832 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:23,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:23,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:23,845 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:23,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:14:23,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:23,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:23,865 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:23,865 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-12 00:14:23,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:23,904 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:23,905 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:23,905 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:23,905 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:23,905 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:23,905 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:23,905 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:23,905 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:23,905 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-10-12 00:14:23,905 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:23,905 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:23,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:23,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,024 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:24,025 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:24,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,028 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:14:24,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:24,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,047 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:24,047 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:24,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:14:24,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,064 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:14:24,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:24,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,081 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:24,081 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-12 00:14:24,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,094 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:14:24,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:24,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,113 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:24,113 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-12 00:14:24,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:14:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,125 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:14:24,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:24,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,137 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:24,137 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-12 00:14:24,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-12 00:14:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,149 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:14:24,151 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:24,151 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,175 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:14:24,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:24,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:24,209 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:24,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:14:24,217 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:24,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:24,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:24,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:24,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:24,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:24,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:24,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2024-10-12 00:14:24,218 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:24,218 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:24,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:24,342 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:24,342 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:24,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,344 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:14:24,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:24,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:24,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:14:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,385 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:14:24,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,422 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:14:24,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:24,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:24,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:14:24,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,460 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:14:24,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:24,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:24,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:24,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,497 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:14:24,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:24,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:24,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:24,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:24,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:14:24,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,534 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:14:24,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:24,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:24,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:24,545 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:14:24,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:24,552 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:14:24,552 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:14:24,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:24,585 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-12 00:14:24,586 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-12 00:14:24,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,588 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:14:24,591 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:24,606 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-10-12 00:14:24,606 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:24,606 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-12 00:14:24,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:24,628 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-10-12 00:14:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:24,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:24,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:24,694 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:24,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:24,739 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-12 00:14:24,739 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-12 00:14:24,826 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-12 00:14:24,828 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-12 00:14:24,828 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-12 00:14:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-10-12 00:14:24,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-12 00:14:24,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:24,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-12 00:14:24,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:24,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2024-10-12 00:14:24,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:24,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2024-10-12 00:14:24,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:24,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2024-10-12 00:14:24,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-12 00:14:24,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-12 00:14:24,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2024-10-12 00:14:24,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:24,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-12 00:14:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2024-10-12 00:14:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-10-12 00:14:24,836 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-12 00:14:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2024-10-12 00:14:24,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-10-12 00:14:24,837 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2024-10-12 00:14:24,837 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:14:24,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2024-10-12 00:14:24,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:24,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:24,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:24,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:24,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:24,839 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-12 00:14:24,839 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-12 00:14:24,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2024-10-12 00:14:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217115235] [2024-10-12 00:14:24,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:24,889 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-12 00:14:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217115235] [2024-10-12 00:14:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217115235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241022385] [2024-10-12 00:14:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:24,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:24,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:24,891 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:24,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-12 00:14:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:24,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:14:24,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:24,928 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-12 00:14:24,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:24,951 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-12 00:14:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241022385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:24,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:24,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-12 00:14:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267608284] [2024-10-12 00:14:24,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:24,952 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2024-10-12 00:14:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890513600] [2024-10-12 00:14:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:24,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:24,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:25,000 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:25,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:25,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:25,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:25,001 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:25,001 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,001 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:25,001 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:25,001 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-10-12 00:14:25,001 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:25,001 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:25,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:25,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:14:25,092 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:25,092 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:25,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,095 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:14:25,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:25,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:25,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:14:25,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,132 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:14:25,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:25,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:25,151 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:25,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:25,167 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:25,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:25,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:25,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:25,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:25,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:25,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:25,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2024-10-12 00:14:25,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:25,167 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:25,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,227 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:25,228 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,230 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:14:25,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:25,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:25,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:25,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:25,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:25,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:25,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:25,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:25,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:25,254 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:14:25,254 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,256 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:14:25,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:25,258 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:25,258 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:25,258 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:14:25,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:14:25,274 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:25,335 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:25,335 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-12 00:14:25,368 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-12 00:14:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:25,369 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-12 00:14:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-12 00:14:25,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:14:25,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2024-10-12 00:14:25,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2024-10-12 00:14:25,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2024-10-12 00:14:25,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-12 00:14:25,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2024-10-12 00:14:25,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 00:14:25,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-10-12 00:14:25,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2024-10-12 00:14:25,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:25,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-10-12 00:14:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2024-10-12 00:14:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-10-12 00:14:25,380 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-12 00:14:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-12 00:14:25,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-12 00:14:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:25,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 00:14:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 00:14:25,382 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-12 00:14:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:25,426 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2024-10-12 00:14:25,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2024-10-12 00:14:25,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-10-12 00:14:25,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2024-10-12 00:14:25,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2024-10-12 00:14:25,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2024-10-12 00:14:25,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2024-10-12 00:14:25,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:25,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2024-10-12 00:14:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2024-10-12 00:14:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-10-12 00:14:25,438 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-12 00:14:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2024-10-12 00:14:25,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-10-12 00:14:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:14:25,441 INFO L425 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2024-10-12 00:14:25,441 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:14:25,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2024-10-12 00:14:25,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-12 00:14:25,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:25,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:25,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:14:25,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:25,443 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-12 00:14:25,443 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-12 00:14:25,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2024-10-12 00:14:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:25,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493800376] [2024-10-12 00:14:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493800376] [2024-10-12 00:14:25,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493800376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:25,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:25,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:14:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254103910] [2024-10-12 00:14:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:25,475 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2024-10-12 00:14:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575228693] [2024-10-12 00:14:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:25,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:25,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:25,507 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:25,508 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:25,508 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:25,508 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:25,508 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:25,508 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,508 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:25,508 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:25,508 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-10-12 00:14:25,508 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:25,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:25,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,599 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:25,600 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,602 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:14:25,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:25,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:25,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:25,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,636 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:14:25,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:25,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:25,674 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:25,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:25,678 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:25,678 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:25,678 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:25,678 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:25,678 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:25,678 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,678 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:25,678 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:25,678 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2024-10-12 00:14:25,678 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:25,678 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:25,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:25,763 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:25,763 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:25,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,765 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:14:25,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:25,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:25,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:25,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:25,776 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:14:25,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:25,778 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:14:25,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:25,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:25,784 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:14:25,784 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:25,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:25,786 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:25,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:14:25,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:25,788 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:25,788 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:25,788 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:14:25,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:25,804 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:25,846 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:25,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:25,876 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:25,876 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-12 00:14:25,908 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-12 00:14:25,910 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-12 00:14:25,911 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-12 00:14:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-12 00:14:25,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2024-10-12 00:14:25,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-12 00:14:25,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-12 00:14:25,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:25,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2024-10-12 00:14:25,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2024-10-12 00:14:25,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2024-10-12 00:14:25,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2024-10-12 00:14:25,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-10-12 00:14:25,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2024-10-12 00:14:25,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:25,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2024-10-12 00:14:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2024-10-12 00:14:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2024-10-12 00:14:25,935 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-12 00:14:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2024-10-12 00:14:25,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2024-10-12 00:14:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:25,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:25,937 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-12 00:14:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:25,958 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2024-10-12 00:14:25,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2024-10-12 00:14:25,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2024-10-12 00:14:25,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2024-10-12 00:14:25,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2024-10-12 00:14:25,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-12 00:14:25,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2024-10-12 00:14:25,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:25,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2024-10-12 00:14:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2024-10-12 00:14:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2024-10-12 00:14:25,977 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-12 00:14:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-10-12 00:14:25,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-12 00:14:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:25,980 INFO L425 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-12 00:14:25,981 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:14:25,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2024-10-12 00:14:25,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2024-10-12 00:14:25,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:25,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:25,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-12 00:14:25,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:14:25,984 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-12 00:14:25,984 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-12 00:14:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2024-10-12 00:14:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:25,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555190201] [2024-10-12 00:14:25,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,039 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-12 00:14:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555190201] [2024-10-12 00:14:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555190201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:26,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:14:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33193302] [2024-10-12 00:14:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:26,040 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2024-10-12 00:14:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:26,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254192198] [2024-10-12 00:14:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:26,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:26,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:26,081 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:26,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:26,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:26,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:26,082 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:26,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:26,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:26,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-10-12 00:14:26,083 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:26,083 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:26,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,180 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:26,181 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,183 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:14:26,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:26,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:26,207 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:26,207 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-12 00:14:26,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:26,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,226 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:14:26,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:26,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:26,246 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:26,246 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-12 00:14:26,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:14:26,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,258 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:14:26,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:26,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:26,278 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:26,278 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-12 00:14:26,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:14:26,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,290 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:14:26,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:26,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:26,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-12 00:14:26,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,315 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:14:26,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:26,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:26,348 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:26,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:26,352 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:26,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:26,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:26,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:26,353 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:26,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:26,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:26,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2024-10-12 00:14:26,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:26,353 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:26,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:26,437 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:26,438 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:26,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,439 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:14:26,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:26,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:26,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:26,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:26,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:26,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:26,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:26,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:26,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:14:26,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,473 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:14:26,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:26,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:26,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:26,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:26,488 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:14:26,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:26,489 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:14:26,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:26,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:26,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,509 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:14:26,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:26,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:26,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:26,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:26,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:26,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:26,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:26,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:26,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:26,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,556 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:14:26,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:26,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:26,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:26,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:26,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:26,569 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:14:26,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:26,570 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:14:26,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:26,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:26,576 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:14:26,576 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:26,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:26,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:26,579 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:26,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:14:26,580 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:26,580 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:26,580 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:26,580 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:14:26,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:14:26,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:26,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,641 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:26,669 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:26,669 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-12 00:14:26,703 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-12 00:14:26,703 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-12 00:14:26,704 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-12 00:14:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-12 00:14:26,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-12 00:14:26,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,705 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:26,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,754 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:26,776 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:26,777 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-12 00:14:26,800 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-12 00:14:26,802 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-12 00:14:26,804 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-12 00:14:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-10-12 00:14:26,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-12 00:14:26,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,805 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:26,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,844 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:26,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:26,866 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:14:26,866 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-12 00:14:26,893 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-12 00:14:26,895 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-12 00:14:26,895 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-12 00:14:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-10-12 00:14:26,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2024-10-12 00:14:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2024-10-12 00:14:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2024-10-12 00:14:26,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:26,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2024-10-12 00:14:26,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-10-12 00:14:26,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2024-10-12 00:14:26,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2024-10-12 00:14:26,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2024-10-12 00:14:26,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2024-10-12 00:14:26,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:26,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2024-10-12 00:14:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2024-10-12 00:14:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2024-10-12 00:14:26,908 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-12 00:14:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-10-12 00:14:26,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-10-12 00:14:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:26,912 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-12 00:14:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:26,930 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-10-12 00:14:26,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2024-10-12 00:14:26,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2024-10-12 00:14:26,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2024-10-12 00:14:26,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2024-10-12 00:14:26,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2024-10-12 00:14:26,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2024-10-12 00:14:26,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:26,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2024-10-12 00:14:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2024-10-12 00:14:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-10-12 00:14:26,937 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-12 00:14:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2024-10-12 00:14:26,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-10-12 00:14:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:26,939 INFO L425 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2024-10-12 00:14:26,939 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:14:26,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2024-10-12 00:14:26,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2024-10-12 00:14:26,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:26,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:26,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:26,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2024-10-12 00:14:26,942 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-12 00:14:26,942 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-12 00:14:26,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2024-10-12 00:14:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975638318] [2024-10-12 00:14:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,961 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-12 00:14:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975638318] [2024-10-12 00:14:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975638318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:26,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:14:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672491221] [2024-10-12 00:14:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:26,963 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2024-10-12 00:14:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484068828] [2024-10-12 00:14:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:26,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484068828] [2024-10-12 00:14:26,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484068828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:26,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:26,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:14:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537834245] [2024-10-12 00:14:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:26,993 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:14:26,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:14:26,994 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-12 00:14:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:27,002 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-10-12 00:14:27,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2024-10-12 00:14:27,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2024-10-12 00:14:27,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2024-10-12 00:14:27,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-10-12 00:14:27,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-10-12 00:14:27,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2024-10-12 00:14:27,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:27,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-12 00:14:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2024-10-12 00:14:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-12 00:14:27,006 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-12 00:14:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-10-12 00:14:27,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-12 00:14:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:14:27,007 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-12 00:14:27,008 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:14:27,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2024-10-12 00:14:27,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2024-10-12 00:14:27,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:27,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:27,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2024-10-12 00:14:27,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2024-10-12 00:14:27,010 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-12 00:14:27,010 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-12 00:14:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2024-10-12 00:14:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335293357] [2024-10-12 00:14:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,117 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-12 00:14:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335293357] [2024-10-12 00:14:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335293357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841307646] [2024-10-12 00:14:27,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:14:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:27,120 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:27,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-10-12 00:14:27,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:14:27,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:27,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:27,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:27,185 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-12 00:14:27,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:27,261 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-12 00:14:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841307646] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:27,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-12 00:14:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375744419] [2024-10-12 00:14:27,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:27,262 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:14:27,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2024-10-12 00:14:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:27,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522936778] [2024-10-12 00:14:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,331 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-12 00:14:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522936778] [2024-10-12 00:14:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522936778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403803909] [2024-10-12 00:14:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:27,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:27,333 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:27,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-10-12 00:14:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:27,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:27,385 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-12 00:14:27,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:27,457 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-12 00:14:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403803909] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:27,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 00:14:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874445501] [2024-10-12 00:14:27,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:27,458 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:14:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:14:27,459 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-12 00:14:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:27,507 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2024-10-12 00:14:27,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2024-10-12 00:14:27,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-12 00:14:27,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2024-10-12 00:14:27,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-12 00:14:27,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-12 00:14:27,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2024-10-12 00:14:27,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:27,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2024-10-12 00:14:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2024-10-12 00:14:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2024-10-12 00:14:27,511 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-12 00:14:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2024-10-12 00:14:27,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-10-12 00:14:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:14:27,512 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2024-10-12 00:14:27,513 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:14:27,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2024-10-12 00:14:27,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2024-10-12 00:14:27,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:27,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:27,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2024-10-12 00:14:27,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2024-10-12 00:14:27,517 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-12 00:14:27,517 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-12 00:14:27,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2024-10-12 00:14:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404901459] [2024-10-12 00:14:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:27,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:27,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2024-10-12 00:14:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248414479] [2024-10-12 00:14:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:27,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:27,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:27,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2024-10-12 00:14:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:27,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733727799] [2024-10-12 00:14:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:27,666 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-12 00:14:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733727799] [2024-10-12 00:14:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733727799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854914792] [2024-10-12 00:14:27,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:14:27,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:27,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:27,669 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:27,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-10-12 00:14:27,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:14:27,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:27,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:14:27,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:27,742 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-12 00:14:27,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:27,779 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-12 00:14:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854914792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:27,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-12 00:14:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667002737] [2024-10-12 00:14:27,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:27,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-12 00:14:27,924 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:27,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:27,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:27,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:27,924 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:27,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:27,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:27,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:27,925 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-10-12 00:14:27,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:27,925 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:27,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:27,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:27,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:27,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:27,970 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:27,970 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:27,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:27,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:27,972 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:27,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:14:27,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:27,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:27,996 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:27,996 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-12 00:14:28,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,013 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:14:28,037 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:28,038 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-12 00:14:28,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,054 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:14:28,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:28,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-12 00:14:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,085 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:14:28,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:28,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:28,103 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:28,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,118 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:28,118 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:28,118 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:28,118 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:28,118 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:28,118 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,118 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:28,118 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:28,119 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2024-10-12 00:14:28,119 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:28,119 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:28,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:28,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:28,169 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:28,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,171 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:14:28,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:28,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:28,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:28,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:28,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:28,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:28,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:28,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:28,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,205 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:14:28,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:28,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:28,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:28,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:28,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:28,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:28,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:28,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:28,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,240 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:14:28,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:28,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:28,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:28,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:28,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:28,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:28,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:28,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:28,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:28,265 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:28,265 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:28,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:28,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:28,268 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:28,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:14:28,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:28,269 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:28,269 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:28,270 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-12 00:14:28,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:28,281 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:28,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,492 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-12 00:14:28,492 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-12 00:14:28,492 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-12 00:14:28,532 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-12 00:14:28,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-12 00:14:28,533 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-12 00:14:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-12 00:14:28,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-12 00:14:28,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:28,534 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:28,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,735 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-12 00:14:28,735 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-12 00:14:28,735 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-12 00:14:28,804 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-12 00:14:28,804 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-12 00:14:28,805 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-12 00:14:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-12 00:14:28,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-12 00:14:28,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:28,806 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:28,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:28,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:28,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:28,995 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-12 00:14:28,996 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-12 00:14:28,996 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-12 00:14:29,028 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-12 00:14:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:29,029 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-12 00:14:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-12 00:14:29,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-12 00:14:29,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:29,030 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:29,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,222 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-12 00:14:29,222 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-12 00:14:29,223 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-12 00:14:29,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 380 states and 401 transitions. Complement of second has 19 states. [2024-10-12 00:14:29,283 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-12 00:14:29,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-12 00:14:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-12 00:14:29,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-12 00:14:29,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:29,285 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:29,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:29,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:29,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:29,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-10-12 00:14:29,483 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-12 00:14:29,484 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-12 00:14:29,485 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-12 00:14:29,688 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-12 00:14:29,689 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-12 00:14:29,689 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-12 00:14:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2024-10-12 00:14:29,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2024-10-12 00:14:29,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:29,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2024-10-12 00:14:29,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:29,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2024-10-12 00:14:29,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:29,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2024-10-12 00:14:29,716 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2024-10-12 00:14:29,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2024-10-12 00:14:29,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-10-12 00:14:29,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2024-10-12 00:14:29,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2024-10-12 00:14:29,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:29,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2024-10-12 00:14:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2024-10-12 00:14:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2024-10-12 00:14:29,729 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-12 00:14:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2024-10-12 00:14:29,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2024-10-12 00:14:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 00:14:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-12 00:14:29,732 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-12 00:14:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:29,781 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2024-10-12 00:14:29,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2024-10-12 00:14:29,785 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2024-10-12 00:14:29,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2024-10-12 00:14:29,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-10-12 00:14:29,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-10-12 00:14:29,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2024-10-12 00:14:29,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:29,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2024-10-12 00:14:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2024-10-12 00:14:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2024-10-12 00:14:29,797 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-12 00:14:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2024-10-12 00:14:29,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-10-12 00:14:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:14:29,799 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2024-10-12 00:14:29,799 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:14:29,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2024-10-12 00:14:29,802 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2024-10-12 00:14:29,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:29,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:29,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2024-10-12 00:14:29,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2024-10-12 00:14:29,804 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-12 00:14:29,804 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-12 00:14:29,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2024-10-12 00:14:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:29,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927375121] [2024-10-12 00:14:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:29,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:29,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:29,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2024-10-12 00:14:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016187754] [2024-10-12 00:14:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:29,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:29,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2024-10-12 00:14:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722617982] [2024-10-12 00:14:29,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,022 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-12 00:14:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722617982] [2024-10-12 00:14:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722617982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:14:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045562589] [2024-10-12 00:14:30,023 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:14:30,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:14:30,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,025 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-10-12 00:14:30,078 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2024-10-12 00:14:30,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:14:30,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:14:30,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:30,118 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-12 00:14:30,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:14:30,221 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-12 00:14:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045562589] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:14:30,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:14:30,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-10-12 00:14:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336722369] [2024-10-12 00:14:30,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:14:30,468 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:30,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:30,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:30,469 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:30,469 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:30,469 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,469 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:30,469 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:30,469 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-10-12 00:14:30,469 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:30,469 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:30,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,517 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:30,517 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:30,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,519 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:14:30,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:30,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:30,544 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:30,544 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-12 00:14:30,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:30,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,562 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:14:30,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:30,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:30,579 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:30,579 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:30,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-12 00:14:30,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,591 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:14:30,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:30,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:30,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:14:30,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,616 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:14:30,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:30,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:30,628 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:30,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:14:30,639 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:30,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:30,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:30,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:30,639 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:30,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:30,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:30,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2024-10-12 00:14:30,639 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:30,639 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:30,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:30,684 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:30,684 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,685 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:14:30,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:30,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:30,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:30,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:30,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:30,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:30,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:30,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:30,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:30,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,712 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 00:14:30,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:30,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:30,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:30,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:30,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:30,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:30,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:30,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:30,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:30,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-12 00:14:30,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,737 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:14:30,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:14:30,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:30,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:30,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:30,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:30,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:30,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:30,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:30,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:30,752 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:14:30,752 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:30,754 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:30,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-12 00:14:30,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:30,755 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:30,755 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:30,755 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-12 00:14:30,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-12 00:14:30,766 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:30,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:30,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:30,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,077 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-12 00:14:31,078 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-12 00:14:31,078 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-12 00:14:31,115 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-12 00:14:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:31,116 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-12 00:14:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-12 00:14:31,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-12 00:14:31,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:31,117 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:31,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,428 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-12 00:14:31,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-12 00:14:31,429 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-12 00:14:31,497 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-12 00:14:31,498 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-12 00:14:31,498 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-12 00:14:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-12 00:14:31,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-12 00:14:31,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:31,498 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:31,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,835 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-12 00:14:31,836 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-12 00:14:31,836 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-12 00:14:31,873 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-12 00:14:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:31,875 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-12 00:14:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-10-12 00:14:31,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-12 00:14:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:31,876 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:31,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:31,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:31,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:32,184 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-12 00:14:32,185 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2024-10-12 00:14:32,185 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-12 00:14:32,257 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-12 00:14:32,258 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-12 00:14:32,258 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-12 00:14:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-12 00:14:32,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-12 00:14:32,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:32,260 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:14:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:32,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:32,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:32,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:14:32,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:32,559 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-12 00:14:32,560 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-12 00:14:32,560 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-12 00:14:33,151 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-12 00:14:33,151 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-12 00:14:33,152 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-12 00:14:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2024-10-12 00:14:33,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2024-10-12 00:14:33,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2024-10-12 00:14:33,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2024-10-12 00:14:33,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:33,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2024-10-12 00:14:33,260 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2024-10-12 00:14:33,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2024-10-12 00:14:33,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2024-10-12 00:14:33,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2024-10-12 00:14:33,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2024-10-12 00:14:33,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:33,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2024-10-12 00:14:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2024-10-12 00:14:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2024-10-12 00:14:33,353 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-12 00:14:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2024-10-12 00:14:33,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2024-10-12 00:14:33,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:14:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:14:33,362 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-12 00:14:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:33,465 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2024-10-12 00:14:33,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2024-10-12 00:14:33,496 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2024-10-12 00:14:33,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2024-10-12 00:14:33,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2024-10-12 00:14:33,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2024-10-12 00:14:33,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2024-10-12 00:14:33,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:33,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2024-10-12 00:14:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2024-10-12 00:14:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2024-10-12 00:14:33,588 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-12 00:14:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2024-10-12 00:14:33,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-10-12 00:14:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:14:33,600 INFO L425 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2024-10-12 00:14:33,600 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:14:33,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2024-10-12 00:14:33,616 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2024-10-12 00:14:33,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:33,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:33,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2024-10-12 00:14:33,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2024-10-12 00:14:33,622 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-12 00:14:33,622 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-12 00:14:33,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2024-10-12 00:14:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616024541] [2024-10-12 00:14:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:33,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:33,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:33,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2024-10-12 00:14:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567537529] [2024-10-12 00:14:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:33,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:33,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:33,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2024-10-12 00:14:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63426296] [2024-10-12 00:14:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:33,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:33,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:34,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:34,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:14:34 BoogieIcfgContainer [2024-10-12 00:14:34,513 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:14:34,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:14:34,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:14:34,514 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:14:34,515 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:14:21" (3/4) ... [2024-10-12 00:14:34,516 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:14:34,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:14:34,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:14:34,582 INFO L158 Benchmark]: Toolchain (without parser) took 13680.83ms. Allocated memory was 161.5MB in the beginning and 264.2MB in the end (delta: 102.8MB). Free memory was 89.6MB in the beginning and 209.9MB in the end (delta: -120.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:14:34,582 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 161.5MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:14:34,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.50ms. Allocated memory is still 161.5MB. Free memory was 89.3MB in the beginning and 78.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:14:34,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 161.5MB. Free memory was 78.3MB in the beginning and 77.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:14:34,582 INFO L158 Benchmark]: Boogie Preprocessor took 24.31ms. Allocated memory is still 161.5MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:14:34,583 INFO L158 Benchmark]: RCFGBuilder took 202.02ms. Allocated memory is still 161.5MB. Free memory was 75.7MB in the beginning and 66.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 00:14:34,583 INFO L158 Benchmark]: BuchiAutomizer took 13157.21ms. Allocated memory was 161.5MB in the beginning and 264.2MB in the end (delta: 102.8MB). Free memory was 66.3MB in the beginning and 215.1MB in the end (delta: -148.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:14:34,583 INFO L158 Benchmark]: Witness Printer took 67.12ms. Allocated memory is still 264.2MB. Free memory was 215.1MB in the beginning and 209.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 00:14:34,584 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.50ms. Allocated memory is still 161.5MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.50ms. Allocated memory is still 161.5MB. Free memory was 89.3MB in the beginning and 78.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 161.5MB. Free memory was 78.3MB in the beginning and 77.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.31ms. Allocated memory is still 161.5MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 202.02ms. Allocated memory is still 161.5MB. Free memory was 75.7MB in the beginning and 66.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 13157.21ms. Allocated memory was 161.5MB in the beginning and 264.2MB in the end (delta: 102.8MB). Free memory was 66.3MB in the beginning and 215.1MB in the end (delta: -148.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.12ms. Allocated memory is still 264.2MB. Free memory was 215.1MB in the beginning and 209.9MB 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 13.0s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 7.2s. Construction of modules took 0.6s. Büchi inclusion checks took 4.7s. 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.2s 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.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.6s 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: 73ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s 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-12 00:14:34,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2024-10-12 00:14:34,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2024-10-12 00:14:35,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2024-10-12 00:14:35,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:35,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-10-12 00:14:35,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)