./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:08:30,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:08:30,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:08:30,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:08:30,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:08:30,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:08:30,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:08:30,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:08:30,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:08:30,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:08:30,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:08:30,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:08:30,807 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:08:30,807 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:08:30,808 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:08:30,808 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:08:30,811 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:08:30,811 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:08:30,811 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:08:30,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:08:30,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:08:30,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:08:30,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:08:30,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:08:30,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:08:30,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:08:30,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:08:30,815 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:08:30,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:08:30,815 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:08:30,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:08:30,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:08:30,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:08:30,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:08:30,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:08:30,818 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:08:30,818 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 [2024-10-15 00:08:31,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:08:31,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:08:31,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:08:31,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:08:31,136 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:08:31,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2024-10-15 00:08:32,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:08:32,896 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:08:32,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2024-10-15 00:08:32,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44c8d5da/33c92031d6ab47759d76be26fca2f851/FLAG6fe5b9b09 [2024-10-15 00:08:32,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44c8d5da/33c92031d6ab47759d76be26fca2f851 [2024-10-15 00:08:32,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:08:32,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:08:32,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:08:32,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:08:32,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:08:32,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:32" (1/1) ... [2024-10-15 00:08:32,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6c0725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:32, skipping insertion in model container [2024-10-15 00:08:32,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:32" (1/1) ... [2024-10-15 00:08:32,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:08:33,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:08:33,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:08:33,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:08:33,127 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:08:33,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33 WrapperNode [2024-10-15 00:08:33,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:08:33,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:08:33,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:08:33,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:08:33,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,155 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-10-15 00:08:33,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:08:33,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:08:33,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:08:33,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:08:33,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,175 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-15 00:08:33,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:08:33,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:08:33,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:08:33,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:08:33,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (1/1) ... [2024-10-15 00:08:33,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:33,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:33,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:33,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:08:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:08:33,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:08:33,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:08:33,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:08:33,383 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-10-15 00:08:33,383 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:08:33,395 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:08:33,396 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 00:08:33,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:33 BoogieIcfgContainer [2024-10-15 00:08:33,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:08:33,399 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:08:33,400 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:08:33,407 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:08:33,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:33,408 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:08:32" (1/3) ... [2024-10-15 00:08:33,409 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b4e49ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:08:33, skipping insertion in model container [2024-10-15 00:08:33,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:33,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:33" (2/3) ... [2024-10-15 00:08:33,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b4e49ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:08:33, skipping insertion in model container [2024-10-15 00:08:33,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:33,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:33" (3/3) ... [2024-10-15 00:08:33,415 INFO L332 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration.c [2024-10-15 00:08:33,467 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:08:33,467 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:08:33,467 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:08:33,467 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:08:33,468 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:08:33,468 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:08:33,468 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:08:33,468 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:08:33,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-15 00:08:33,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:33,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:33,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:33,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:08:33,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:33,497 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:08:33,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-15 00:08:33,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:33,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:33,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:33,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:08:33,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:33,506 INFO L745 eck$LassoCheckResult]: Stem: 4#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 7#L15-2true [2024-10-15 00:08:33,506 INFO L747 eck$LassoCheckResult]: Loop: 7#L15-2true assume !!(main_~c~0#1 > 0); 5#L15true assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 7#L15-2true [2024-10-15 00:08:33,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:33,511 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:08:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103327776] [2024-10-15 00:08:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:33,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:33,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:33,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-10-15 00:08:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162181070] [2024-10-15 00:08:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:33,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:33,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:33,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-10-15 00:08:33,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:33,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379868295] [2024-10-15 00:08:33,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:33,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:33,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:33,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:33,792 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:33,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:33,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:33,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:33,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:33,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:33,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:33,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:33,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2024-10-15 00:08:33,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:33,794 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:33,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:33,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:33,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:33,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:33,924 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:33,925 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:33,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:33,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:33,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:33,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:08:33,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:33,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:33,961 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:33,962 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-15 00:08:33,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:08:33,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:33,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:33,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:33,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:08:33,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:33,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:33,998 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:33,998 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-15 00:08:34,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:08:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:08:34,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:34,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:08:34,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:08:34,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:34,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,093 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:34,094 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0#1=0}, {ULTIMATE.start_main_~c~0#1=1}, {ULTIMATE.start_main_~c~0#1=0}] Lambdas: [0, 1, 5] Nus: [0, 0] [2024-10-15 00:08:34,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:08:34,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:08:34,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:34,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:08:34,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:34,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,186 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:34,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:34,191 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:34,191 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:34,192 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:34,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:34,192 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:34,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:34,192 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:34,192 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2024-10-15 00:08:34,192 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:34,192 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:34,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,270 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:34,275 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:08:34,282 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-15 00:08:34,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:34,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:34,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:34,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:34,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:34,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:34,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:34,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:08:34,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:08:34,337 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-15 00:08:34,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:34,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:34,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:34,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:34,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:34,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:34,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:34,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:08:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,378 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:08:34,381 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-15 00:08:34,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:34,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:34,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:34,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:34,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:34,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:34,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:34,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:34,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:08:34,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:08:34,419 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-15 00:08:34,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:34,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:34,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:34,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:34,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:34,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:34,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:34,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:34,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:34,439 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:34,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,443 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:08:34,444 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:34,444 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:34,445 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:34,445 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2024-10-15 00:08:34,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-15 00:08:34,460 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:34,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:34,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:34,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:34,520 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:34,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:34,528 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-15 00:08:34,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-15 00:08:34,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) 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-15 00:08:34,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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). 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) Result 20 states and 28 transitions. Complement of second has 6 states. [2024-10-15 00:08:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. 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-15 00:08:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-15 00:08:34,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-15 00:08:34,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:34,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:08:34,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:34,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-15 00:08:34,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:34,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2024-10-15 00:08:34,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:34,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 8 states and 11 transitions. [2024-10-15 00:08:34,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-15 00:08:34,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-15 00:08:34,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-10-15 00:08:34,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:34,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-10-15 00:08:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-10-15 00:08:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-15 00:08:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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-15 00:08:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-10-15 00:08:34,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-10-15 00:08:34,652 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-10-15 00:08:34,652 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:08:34,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2024-10-15 00:08:34,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:34,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:34,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:34,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:08:34,653 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:34,654 INFO L745 eck$LassoCheckResult]: Stem: 67#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 68#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 69#L15-2 assume !!(main_~c~0#1 > 0); 63#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 64#L15-2 [2024-10-15 00:08:34,654 INFO L747 eck$LassoCheckResult]: Loop: 64#L15-2 assume !!(main_~c~0#1 > 0); 70#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 64#L15-2 [2024-10-15 00:08:34,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-15 00:08:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:34,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785936340] [2024-10-15 00:08:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:34,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:34,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:34,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-10-15 00:08:34,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:34,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68103919] [2024-10-15 00:08:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:34,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:34,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:34,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2024-10-15 00:08:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845199759] [2024-10-15 00:08:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:34,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:34,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845199759] [2024-10-15 00:08:34,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845199759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:08:34,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:08:34,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:08:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291573889] [2024-10-15 00:08:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:08:34,797 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:34,797 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:34,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:34,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:34,798 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:34,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:34,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:34,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2024-10-15 00:08:34,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:34,798 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:34,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:34,881 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:34,882 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,885 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:08:34,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:34,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,917 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:34,917 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-15 00:08:34,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:34,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,931 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:08:34,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:34,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,952 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:34,953 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:08:34,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:08:34,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:34,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:34,966 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:34,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:08:34,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:34,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:34,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:08:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,002 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:08:35,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:35,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:35,047 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:35,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-15 00:08:35,054 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:35,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:35,055 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:35,055 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:35,055 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:35,055 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,055 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:35,055 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:35,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2024-10-15 00:08:35,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:35,056 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:35,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,142 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:35,143 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:35,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,145 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-15 00:08:35,153 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-15 00:08:35,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:35,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:35,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:35,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:35,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:35,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:35,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:35,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,194 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-15 00:08:35,198 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-15 00:08:35,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:35,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:35,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:35,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:35,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:35,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:35,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:35,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-15 00:08:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,240 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-15 00:08:35,243 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-15 00:08:35,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:35,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:35,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:35,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:35,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:35,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:35,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:35,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:35,267 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:35,267 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:35,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,271 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:35,280 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:35,280 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:35,280 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2024-10-15 00:08:35,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-15 00:08:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:35,299 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:35,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:35,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:35,357 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:35,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:35,364 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-15 00:08:35,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:35,376 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2024-10-15 00:08:35,377 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-15 00:08:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-15 00:08:35,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:08:35,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-15 00:08:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-15 00:08:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:35,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2024-10-15 00:08:35,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:35,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2024-10-15 00:08:35,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:08:35,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:08:35,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-10-15 00:08:35,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:35,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-15 00:08:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-10-15 00:08:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-15 00:08:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-10-15 00:08:35,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-15 00:08:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:35,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:08:35,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:08:35,389 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. 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-15 00:08:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:35,405 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-15 00:08:35,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2024-10-15 00:08:35,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:35,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 17 transitions. [2024-10-15 00:08:35,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:08:35,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:08:35,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2024-10-15 00:08:35,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:35,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-15 00:08:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2024-10-15 00:08:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-10-15 00:08:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-15 00:08:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-15 00:08:35,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-15 00:08:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:08:35,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-15 00:08:35,411 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:08:35,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-15 00:08:35,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-15 00:08:35,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:35,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:35,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2024-10-15 00:08:35,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:35,413 INFO L745 eck$LassoCheckResult]: Stem: 149#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 155#L15-2 assume !!(main_~c~0#1 > 0); 156#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 160#L15-2 assume !!(main_~c~0#1 > 0); 159#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 157#L15-2 assume !!(main_~c~0#1 > 0); 151#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 152#L15-2 [2024-10-15 00:08:35,414 INFO L747 eck$LassoCheckResult]: Loop: 152#L15-2 assume !!(main_~c~0#1 > 0); 158#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 152#L15-2 [2024-10-15 00:08:35,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 297591406, now seen corresponding path program 2 times [2024-10-15 00:08:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:35,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914768605] [2024-10-15 00:08:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:35,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2024-10-15 00:08:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507156162] [2024-10-15 00:08:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:35,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1777467309, now seen corresponding path program 3 times [2024-10-15 00:08:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242193021] [2024-10-15 00:08:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:08:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:35,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242193021] [2024-10-15 00:08:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242193021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:08:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651493892] [2024-10-15 00:08:35,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:08:35,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:08:35,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,583 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-15 00:08:35,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 00:08:35,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:08:35,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:08:35,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:08:35,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:08:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:08:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651493892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:08:35,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:08:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-15 00:08:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832480252] [2024-10-15 00:08:35,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:08:35,749 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:35,749 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:35,749 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:35,749 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:35,750 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:35,750 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,750 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:35,750 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:35,750 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2024-10-15 00:08:35,750 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:35,751 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:35,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:35,818 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:35,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,822 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-15 00:08:35,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:35,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:35,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-15 00:08:35,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,856 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-15 00:08:35,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:35,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:35,892 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:35,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:35,898 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:35,898 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:35,898 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:35,898 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:35,898 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:35,899 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,899 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:35,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:35,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2024-10-15 00:08:35,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:35,899 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:35,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:35,979 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:35,980 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:35,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,982 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:35,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-15 00:08:35,985 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-15 00:08:35,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:35,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:35,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:35,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:35,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:36,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:36,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:36,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:36,009 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:36,009 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:36,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,014 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:36,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-15 00:08:36,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:36,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:36,017 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:36,017 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2024-10-15 00:08:36,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:36,036 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:36,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,087 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,091 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-15 00:08:36,092 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-15 00:08:36,092 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:36,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 14 states and 20 transitions. Complement of second has 5 states. [2024-10-15 00:08:36,101 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-15 00:08:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-15 00:08:36,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2024-10-15 00:08:36,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,102 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:36,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,144 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,150 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-15 00:08:36,151 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-10-15 00:08:36,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:36,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 14 states and 20 transitions. Complement of second has 5 states. [2024-10-15 00:08:36,160 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-15 00:08:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-15 00:08:36,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2024-10-15 00:08:36,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,161 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,197 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,199 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-15 00:08:36,200 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 1 loop predicates [2024-10-15 00:08:36,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:36,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 16 states and 23 transitions. Complement of second has 4 states. [2024-10-15 00:08:36,211 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-15 00:08:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-10-15 00:08:36,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2024-10-15 00:08:36,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-10-15 00:08:36,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-15 00:08:36,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2024-10-15 00:08:36,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:36,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2024-10-15 00:08:36,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-15 00:08:36,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:08:36,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2024-10-15 00:08:36,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:36,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2024-10-15 00:08:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2024-10-15 00:08:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2024-10-15 00:08:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2024-10-15 00:08:36,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2024-10-15 00:08:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:36,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:08:36,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:08:36,222 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:36,240 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2024-10-15 00:08:36,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-10-15 00:08:36,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:08:36,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2024-10-15 00:08:36,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:08:36,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:08:36,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2024-10-15 00:08:36,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:36,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-15 00:08:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2024-10-15 00:08:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2024-10-15 00:08:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-15 00:08:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-10-15 00:08:36,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-15 00:08:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 00:08:36,247 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-15 00:08:36,247 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:08:36,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2024-10-15 00:08:36,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:08:36,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:36,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:36,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:08:36,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-10-15 00:08:36,248 INFO L745 eck$LassoCheckResult]: Stem: 399#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 402#L15-2 [2024-10-15 00:08:36,248 INFO L747 eck$LassoCheckResult]: Loop: 402#L15-2 assume !!(main_~c~0#1 > 0); 405#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 408#L15-2 assume !!(main_~c~0#1 > 0); 401#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 402#L15-2 [2024-10-15 00:08:36,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-15 00:08:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522891791] [2024-10-15 00:08:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1266953, now seen corresponding path program 1 times [2024-10-15 00:08:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684311735] [2024-10-15 00:08:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 889694155, now seen corresponding path program 4 times [2024-10-15 00:08:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129679271] [2024-10-15 00:08:36,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,350 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:36,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:36,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:36,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:36,351 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:36,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:36,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:36,351 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2024-10-15 00:08:36,351 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:36,351 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:36,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,415 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:36,415 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,417 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:36,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-15 00:08:36,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:36,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:36,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,456 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:36,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:36,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,480 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:36,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-15 00:08:36,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:36,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-15 00:08:36,506 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:36,506 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:36,506 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:36,506 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:36,506 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:36,506 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,506 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:36,506 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:36,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2024-10-15 00:08:36,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:36,507 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:36,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-15 00:08:36,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:36,612 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:36,612 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,614 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:36,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-15 00:08:36,616 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-15 00:08:36,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:36,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:36,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:36,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:36,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:36,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:36,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:36,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:36,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:36,633 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,635 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:36,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-15 00:08:36,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:36,638 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:36,638 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:36,638 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 201 Supporting invariants [] [2024-10-15 00:08:36,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:36,656 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:36,728 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-15 00:08:36,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 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-15 00:08:36,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. 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 21 states and 27 transitions. Complement of second has 5 states. [2024-10-15 00:08:36,738 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-15 00:08:36,740 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-15 00:08:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2024-10-15 00:08:36,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-15 00:08:36,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,740 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:36,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:36,796 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-15 00:08:36,797 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 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-15 00:08:36,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. 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 25 states and 33 transitions. Complement of second has 7 states. [2024-10-15 00:08:36,819 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-15 00:08:36,820 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-15 00:08:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2024-10-15 00:08:36,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-15 00:08:36,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2024-10-15 00:08:36,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 8 letters. [2024-10-15 00:08:36,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-10-15 00:08:36,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:36,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2024-10-15 00:08:36,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-15 00:08:36,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-15 00:08:36,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2024-10-15 00:08:36,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:36,824 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-15 00:08:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2024-10-15 00:08:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-10-15 00:08:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-15 00:08:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-15 00:08:36,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:08:36,827 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-15 00:08:36,827 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:08:36,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-15 00:08:36,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:36,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:36,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:36,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2024-10-15 00:08:36,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:36,831 INFO L745 eck$LassoCheckResult]: Stem: 523#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 525#L15-2 assume !!(main_~c~0#1 > 0); 521#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 522#L15-2 assume !!(main_~c~0#1 > 0); 529#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 532#L15-2 assume !!(main_~c~0#1 > 0); 531#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 528#L15-2 assume !!(main_~c~0#1 > 0); 519#L15 [2024-10-15 00:08:36,831 INFO L747 eck$LassoCheckResult]: Loop: 519#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 520#L15-2 assume !!(main_~c~0#1 > 0); 519#L15 [2024-10-15 00:08:36,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 635458587, now seen corresponding path program 5 times [2024-10-15 00:08:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883900976] [2024-10-15 00:08:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-10-15 00:08:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029022266] [2024-10-15 00:08:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash 790346520, now seen corresponding path program 6 times [2024-10-15 00:08:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113588925] [2024-10-15 00:08:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,915 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:36,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:36,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:36,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:36,916 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:36,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:36,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:36,916 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2024-10-15 00:08:36,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:36,916 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:36,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,980 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:36,980 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,984 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:36,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-15 00:08:36,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:36,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:37,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:37,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,023 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-15 00:08:37,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:37,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:37,103 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:37,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:37,111 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:37,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:37,111 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:37,111 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:37,111 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:37,111 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,111 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:37,111 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:37,111 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2024-10-15 00:08:37,111 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:37,111 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:37,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,175 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:37,175 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,178 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-15 00:08:37,180 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-15 00:08:37,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:37,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:37,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:37,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:37,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:37,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:37,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:37,194 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:37,195 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:08:37,196 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:37,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,197 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-15 00:08:37,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:37,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:37,198 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:37,198 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2024-10-15 00:08:37,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-15 00:08:37,210 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,252 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,263 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-15 00:08:37,263 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-15 00:08:37,263 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:37,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 16 states and 21 transitions. Complement of second has 3 states. [2024-10-15 00:08:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2024-10-15 00:08:37,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-15 00:08:37,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,269 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,313 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:37,329 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-15 00:08:37,330 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:37,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 16 states and 21 transitions. Complement of second has 3 states. [2024-10-15 00:08:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2024-10-15 00:08:37,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-15 00:08:37,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,337 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:37,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,372 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,379 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-15 00:08:37,380 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-15 00:08:37,380 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:37,398 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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) Result 21 states and 28 transitions. Complement of second has 4 states. [2024-10-15 00:08:37,398 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-15 00:08:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) 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-15 00:08:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-10-15 00:08:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-15 00:08:37,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2024-10-15 00:08:37,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:08:37,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2024-10-15 00:08:37,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-15 00:08:37,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 24 transitions. [2024-10-15 00:08:37,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-10-15 00:08:37,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2024-10-15 00:08:37,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-10-15 00:08:37,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:37,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-15 00:08:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-10-15 00:08:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-15 00:08:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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-15 00:08:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-10-15 00:08:37,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-15 00:08:37,403 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-15 00:08:37,403 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:08:37,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2024-10-15 00:08:37,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-15 00:08:37,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:37,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:37,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2024-10-15 00:08:37,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-10-15 00:08:37,405 INFO L745 eck$LassoCheckResult]: Stem: 712#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 714#L15-2 assume !!(main_~c~0#1 > 0); 715#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 722#L15-2 assume !!(main_~c~0#1 > 0); 721#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 720#L15-2 assume !!(main_~c~0#1 > 0); 718#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 719#L15-2 assume !!(main_~c~0#1 > 0); 709#L15 [2024-10-15 00:08:37,405 INFO L747 eck$LassoCheckResult]: Loop: 709#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 710#L15-2 assume !!(main_~c~0#1 > 0); 716#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 717#L15-2 assume !!(main_~c~0#1 > 0); 709#L15 [2024-10-15 00:08:37,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash 635458587, now seen corresponding path program 7 times [2024-10-15 00:08:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400850789] [2024-10-15 00:08:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:37,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:37,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-10-15 00:08:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610002419] [2024-10-15 00:08:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:37,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:37,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash -686205165, now seen corresponding path program 8 times [2024-10-15 00:08:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744893910] [2024-10-15 00:08:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:37,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:37,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:37,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:37,519 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:37,520 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:37,520 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:37,520 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:37,520 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:37,520 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,520 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:37,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:37,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2024-10-15 00:08:37,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:37,521 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:37,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,583 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:37,587 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:37,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,589 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-15 00:08:37,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:37,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:37,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:37,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,620 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-15 00:08:37,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:37,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:37,641 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:37,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-15 00:08:37,657 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:37,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:37,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:37,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:37,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:37,658 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,658 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:37,658 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:37,658 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2024-10-15 00:08:37,658 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:37,658 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:37,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:37,718 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:37,718 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:37,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,720 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-15 00:08:37,722 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-15 00:08:37,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:37,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:37,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:37,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:37,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:37,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:37,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:37,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:37,737 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:37,737 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:37,738 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:37,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-15 00:08:37,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:37,739 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:37,739 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:37,740 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 221 Supporting invariants [] [2024-10-15 00:08:37,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-15 00:08:37,751 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:37,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:37,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:08:37,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 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-15 00:08:37,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 33 transitions. Complement of second has 7 states. [2024-10-15 00:08:37,837 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-15 00:08:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-15 00:08:37,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:08:37,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,839 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:37,898 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:08:37,898 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 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-15 00:08:37,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 7 states. [2024-10-15 00:08:37,917 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-15 00:08:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-15 00:08:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:08:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:37,918 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:37,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:37,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 00:08:37,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:37,980 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 3 loop predicates [2024-10-15 00:08:37,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 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-15 00:08:37,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 53 transitions. Complement of second has 8 states. [2024-10-15 00:08:38,001 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-15 00:08:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-15 00:08:38,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-15 00:08:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 4 letters. [2024-10-15 00:08:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 8 letters. [2024-10-15 00:08:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:38,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-10-15 00:08:38,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-10-15 00:08:38,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 40 transitions. [2024-10-15 00:08:38,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-15 00:08:38,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:08:38,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2024-10-15 00:08:38,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:38,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-10-15 00:08:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2024-10-15 00:08:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-10-15 00:08:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-15 00:08:38,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-15 00:08:38,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-15 00:08:38,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:08:38,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2024-10-15 00:08:38,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-15 00:08:38,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:38,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:38,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 3, 3, 1, 1] [2024-10-15 00:08:38,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1] [2024-10-15 00:08:38,013 INFO L745 eck$LassoCheckResult]: Stem: 983#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 984#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 985#L15-2 assume !!(main_~c~0#1 > 0); 995#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 996#L15-2 assume !!(main_~c~0#1 > 0); 993#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 991#L15-2 assume !!(main_~c~0#1 > 0); 990#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 986#L15-2 assume !!(main_~c~0#1 > 0); 987#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 981#L15-2 assume !!(main_~c~0#1 > 0); 1003#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1002#L15-2 assume !!(main_~c~0#1 > 0); 1001#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 999#L15-2 assume !!(main_~c~0#1 > 0); 980#L15 [2024-10-15 00:08:38,014 INFO L747 eck$LassoCheckResult]: Loop: 980#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 981#L15-2 assume !!(main_~c~0#1 > 0); 1003#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1002#L15-2 assume !!(main_~c~0#1 > 0); 1001#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 999#L15-2 assume !!(main_~c~0#1 > 0); 980#L15 [2024-10-15 00:08:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1981740944, now seen corresponding path program 9 times [2024-10-15 00:08:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452308036] [2024-10-15 00:08:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 00:08:38,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:38,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452308036] [2024-10-15 00:08:38,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452308036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:08:38,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:08:38,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 00:08:38,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490846694] [2024-10-15 00:08:38,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:08:38,060 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:08:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1298898678, now seen corresponding path program 3 times [2024-10-15 00:08:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284421149] [2024-10-15 00:08:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:38,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:38,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:38,124 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:38,124 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:38,124 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:38,124 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:38,124 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:38,124 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:38,124 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:38,124 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:38,124 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2024-10-15 00:08:38,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:38,124 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:38,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,183 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:38,183 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:38,185 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:38,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-15 00:08:38,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:38,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:38,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:38,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:38,221 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:38,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-15 00:08:38,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:38,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:38,434 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:38,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:38,441 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:38,441 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:38,441 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:38,441 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:38,441 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:38,441 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:38,441 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:38,441 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:38,441 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2024-10-15 00:08:38,441 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:38,441 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:38,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:38,499 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:38,499 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:38,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:38,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:38,502 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:38,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-15 00:08:38,504 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-15 00:08:38,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:38,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:38,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:38,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:38,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:38,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:38,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:38,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:38,525 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:08:38,525 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:38,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:38,527 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:38,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-15 00:08:38,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:38,529 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:38,529 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:38,529 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-10-15 00:08:38,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-15 00:08:38,546 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:38,644 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-15 00:08:38,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:38,649 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 27 states and 36 transitions. Complement of second has 3 states. [2024-10-15 00:08:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2024-10-15 00:08:38,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-15 00:08:38,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:38,650 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:38,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:38,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-15 00:08:38,736 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:38,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 27 states and 36 transitions. Complement of second has 3 states. [2024-10-15 00:08:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2024-10-15 00:08:38,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-15 00:08:38,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:38,741 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:38,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-15 00:08:38,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:38,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:38,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:38,881 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 4 loop predicates [2024-10-15 00:08:38,882 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:38,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 45 states and 55 transitions. Complement of second has 4 states. [2024-10-15 00:08:38,889 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-15 00:08:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-10-15 00:08:38,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-15 00:08:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:38,890 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:38,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:38,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:38,977 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 4 loop predicates [2024-10-15 00:08:38,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:39,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 75 states and 94 transitions. Complement of second has 12 states. [2024-10-15 00:08:39,006 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-15 00:08:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2024-10-15 00:08:39,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-15 00:08:39,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:39,007 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:39,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:39,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:39,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:39,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:39,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:39,104 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 4 loop predicates [2024-10-15 00:08:39,105 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:39,158 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,158 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,182 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,219 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,219 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,239 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,242 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:39,244 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 525 states and 880 transitions. Complement of second has 116 states 12 powerset states104 rank states. The highest rank that occured is 7 [2024-10-15 00:08:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-15 00:08:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2024-10-15 00:08:39,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 15 letters. Loop has 6 letters. [2024-10-15 00:08:39,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:39,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 21 letters. Loop has 6 letters. [2024-10-15 00:08:39,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:39,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 15 letters. Loop has 12 letters. [2024-10-15 00:08:39,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:39,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 880 transitions. [2024-10-15 00:08:39,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 68 [2024-10-15 00:08:39,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 384 states and 664 transitions. [2024-10-15 00:08:39,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-15 00:08:39,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2024-10-15 00:08:39,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 384 states and 664 transitions. [2024-10-15 00:08:39,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:39,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 384 states and 664 transitions. [2024-10-15 00:08:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states and 664 transitions. [2024-10-15 00:08:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 99. [2024-10-15 00:08:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 98 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-15 00:08:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 162 transitions. [2024-10-15 00:08:39,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 162 transitions. [2024-10-15 00:08:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 00:08:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-15 00:08:39,306 INFO L87 Difference]: Start difference. First operand 99 states and 162 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-15 00:08:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:39,322 INFO L93 Difference]: Finished difference Result 122 states and 184 transitions. [2024-10-15 00:08:39,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 184 transitions. [2024-10-15 00:08:39,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2024-10-15 00:08:39,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 110 states and 166 transitions. [2024-10-15 00:08:39,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-15 00:08:39,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-15 00:08:39,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 166 transitions. [2024-10-15 00:08:39,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:39,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 166 transitions. [2024-10-15 00:08:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 166 transitions. [2024-10-15 00:08:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-10-15 00:08:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 91 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-15 00:08:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2024-10-15 00:08:39,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 140 transitions. [2024-10-15 00:08:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 00:08:39,341 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 140 transitions. [2024-10-15 00:08:39,341 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:08:39,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 140 transitions. [2024-10-15 00:08:39,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2024-10-15 00:08:39,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:39,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:39,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2024-10-15 00:08:39,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 2, 2] [2024-10-15 00:08:39,344 INFO L745 eck$LassoCheckResult]: Stem: 2413#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 2465#L15-2 assume !!(main_~c~0#1 > 0); 2460#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2462#L15-2 assume !!(main_~c~0#1 > 0); 2432#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2429#L15-2 assume !!(main_~c~0#1 > 0); 2431#L15 [2024-10-15 00:08:39,344 INFO L747 eck$LassoCheckResult]: Loop: 2431#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2416#L15-2 assume !!(main_~c~0#1 > 0); 2417#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2455#L15-2 assume !!(main_~c~0#1 > 0); 2422#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2423#L15-2 assume !!(main_~c~0#1 > 0); 2439#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2437#L15-2 assume !!(main_~c~0#1 > 0); 2431#L15 [2024-10-15 00:08:39,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:39,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1810715102, now seen corresponding path program 2 times [2024-10-15 00:08:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:39,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125077268] [2024-10-15 00:08:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:39,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:39,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1593853071, now seen corresponding path program 4 times [2024-10-15 00:08:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:39,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891641727] [2024-10-15 00:08:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 00:08:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891641727] [2024-10-15 00:08:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891641727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:08:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:08:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:08:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393099684] [2024-10-15 00:08:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:08:39,385 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:08:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:39,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:08:39,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:08:39,385 INFO L87 Difference]: Start difference. First operand 92 states and 140 transitions. cyclomatic complexity: 55 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-15 00:08:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:39,395 INFO L93 Difference]: Finished difference Result 113 states and 154 transitions. [2024-10-15 00:08:39,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 154 transitions. [2024-10-15 00:08:39,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2024-10-15 00:08:39,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 93 states and 126 transitions. [2024-10-15 00:08:39,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-15 00:08:39,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-15 00:08:39,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 126 transitions. [2024-10-15 00:08:39,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:39,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 126 transitions. [2024-10-15 00:08:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 126 transitions. [2024-10-15 00:08:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2024-10-15 00:08:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-15 00:08:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-10-15 00:08:39,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-10-15 00:08:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:08:39,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-10-15 00:08:39,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:08:39,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2024-10-15 00:08:39,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2024-10-15 00:08:39,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:39,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:39,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2024-10-15 00:08:39,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 6, 4] [2024-10-15 00:08:39,403 INFO L745 eck$LassoCheckResult]: Stem: 2624#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 2627#L15-2 assume !!(main_~c~0#1 > 0); 2687#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2659#L15-2 assume !!(main_~c~0#1 > 0); 2681#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2682#L15-2 assume !!(main_~c~0#1 > 0); 2621#L15 [2024-10-15 00:08:39,403 INFO L747 eck$LassoCheckResult]: Loop: 2621#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2622#L15-2 assume !!(main_~c~0#1 > 0); 2686#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2683#L15-2 assume !!(main_~c~0#1 > 0); 2680#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2679#L15-2 assume !!(main_~c~0#1 > 0); 2678#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2676#L15-2 assume !!(main_~c~0#1 > 0); 2675#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2674#L15-2 assume !!(main_~c~0#1 > 0); 2671#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2673#L15-2 assume !!(main_~c~0#1 > 0); 2672#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2670#L15-2 assume !!(main_~c~0#1 > 0); 2669#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2668#L15-2 assume !!(main_~c~0#1 > 0); 2667#L15 assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 2666#L15-2 assume !!(main_~c~0#1 > 0); 2665#L15 assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1; 2663#L15-2 assume !!(main_~c~0#1 > 0); 2621#L15 [2024-10-15 00:08:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1810715102, now seen corresponding path program 3 times [2024-10-15 00:08:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274791610] [2024-10-15 00:08:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:39,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:39,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -860275429, now seen corresponding path program 5 times [2024-10-15 00:08:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353570090] [2024-10-15 00:08:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:39,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:39,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1172307576, now seen corresponding path program 10 times [2024-10-15 00:08:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096132025] [2024-10-15 00:08:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 00:08:39,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096132025] [2024-10-15 00:08:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096132025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:08:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332606125] [2024-10-15 00:08:39,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:08:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:08:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:39,617 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:08:39,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-10-15 00:08:39,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:08:39,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:08:39,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:39,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 00:08:39,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:08:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 00:08:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332606125] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:08:39,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:08:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-10-15 00:08:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364761275] [2024-10-15 00:08:39,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:08:40,000 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:40,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:40,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:40,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:40,000 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:40,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:40,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:40,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration9_Loop [2024-10-15 00:08:40,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:40,000 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:40,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,053 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:40,054 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:40,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:40,055 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:40,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-15 00:08:40,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:40,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:40,077 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:40,078 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:08:40,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-15 00:08:40,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:40,092 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:40,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-15 00:08:40,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:40,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:40,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:08:40,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:40,118 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:40,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-15 00:08:40,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:40,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:40,175 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:40,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:40,180 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:40,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:40,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:40,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:40,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:40,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:40,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:40,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration9_Loop [2024-10-15 00:08:40,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:40,181 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:40,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:40,242 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:40,243 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:40,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:40,244 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:40,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-15 00:08:40,246 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-15 00:08:40,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:40,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:40,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:40,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:40,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:40,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:40,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:40,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:40,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:40,280 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:40,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-15 00:08:40,283 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-15 00:08:40,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:40,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:40,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:40,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:40,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:40,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:40,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:40,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:40,304 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-15 00:08:40,305 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:40,307 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:40,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-15 00:08:40,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:40,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:40,309 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:40,309 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2024-10-15 00:08:40,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:40,326 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 00:08:40,450 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2024-10-15 00:08:40,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 74 states and 102 transitions. Complement of second has 3 states. [2024-10-15 00:08:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2024-10-15 00:08:40,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 7 letters. Loop has 20 letters. [2024-10-15 00:08:40,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:40,458 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:40,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 00:08:40,619 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2024-10-15 00:08:40,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 74 states and 102 transitions. Complement of second has 3 states. [2024-10-15 00:08:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2024-10-15 00:08:40,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 7 letters. Loop has 20 letters. [2024-10-15 00:08:40,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:40,625 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:40,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 00:08:40,740 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 6 loop predicates [2024-10-15 00:08:40,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 104 states and 136 transitions. Complement of second has 4 states. [2024-10-15 00:08:40,755 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-15 00:08:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-10-15 00:08:40,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 20 letters. [2024-10-15 00:08:40,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:40,756 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:40,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 00:08:40,872 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 6 loop predicates [2024-10-15 00:08:40,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 102 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 104 states and 136 transitions. Complement of second has 4 states. [2024-10-15 00:08:40,891 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-15 00:08:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-10-15 00:08:40,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 20 letters. [2024-10-15 00:08:40,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:40,892 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:08:40,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:40,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:40,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 00:08:41,003 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 6 loop predicates [2024-10-15 00:08:41,003 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 74 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:41,085 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,088 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,089 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,089 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,089 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,103 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,106 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,106 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,107 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,107 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,122 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,126 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,126 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,127 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,127 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,127 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,127 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,132 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,132 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,135 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,135 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,136 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,136 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,136 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,136 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,136 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,137 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,137 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,137 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,137 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,163 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,163 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,166 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,167 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,167 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,167 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,167 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,168 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,168 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,168 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,168 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,172 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,172 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,176 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,176 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,176 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,177 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,177 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,177 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,178 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,178 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,178 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,183 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,184 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,185 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,185 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,189 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,190 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,191 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,191 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,191 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,191 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,191 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,192 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,192 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,192 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,192 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,193 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,193 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,193 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,193 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,196 WARN L278 uchiComplementFKVNwa]: big7 [2024-10-15 00:08:41,197 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,198 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,198 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,202 WARN L278 uchiComplementFKVNwa]: big7 [2024-10-15 00:08:41,203 WARN L278 uchiComplementFKVNwa]: big7 [2024-10-15 00:08:41,204 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,204 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,204 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,204 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,204 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,204 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,205 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,206 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,209 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,209 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,209 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,215 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,215 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,215 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,215 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,215 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,215 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,216 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,216 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,216 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,216 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,216 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,216 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,217 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,217 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,220 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,220 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,225 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,226 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,226 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,226 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,227 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,231 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,231 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,234 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,237 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,237 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,238 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,238 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,238 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,238 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,238 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,241 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,242 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,242 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,243 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,243 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,244 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,244 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,244 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,246 WARN L278 uchiComplementFKVNwa]: big7 [2024-10-15 00:08:41,247 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,247 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,248 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,248 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,249 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,249 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,249 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,250 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,250 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,250 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,251 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,253 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,254 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,254 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,255 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,255 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,256 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,256 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,256 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,256 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,260 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,261 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,261 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,262 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,262 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,262 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,263 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,264 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,264 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,265 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,265 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,265 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,266 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,268 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,269 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,269 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,270 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,273 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,273 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,273 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,274 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,275 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,275 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,278 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,279 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,279 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,286 WARN L278 uchiComplementFKVNwa]: big7 [2024-10-15 00:08:41,287 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,287 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,288 WARN L278 uchiComplementFKVNwa]: big16 [2024-10-15 00:08:41,289 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,290 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,290 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,290 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,294 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,297 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,297 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,297 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,298 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,298 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,304 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,305 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,305 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,328 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,329 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,333 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,333 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,333 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,334 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,334 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,337 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,338 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,338 WARN L278 uchiComplementFKVNwa]: big8 [2024-10-15 00:08:41,345 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 74 states and 102 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 4742 states and 8919 transitions. Complement of second has 430 states 13 powerset states417 rank states. The highest rank that occured is 9 [2024-10-15 00:08:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-15 00:08:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2024-10-15 00:08:41,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34 transitions. Stem has 7 letters. Loop has 20 letters. [2024-10-15 00:08:41,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:41,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34 transitions. Stem has 27 letters. Loop has 20 letters. [2024-10-15 00:08:41,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:41,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 34 transitions. Stem has 7 letters. Loop has 40 letters. [2024-10-15 00:08:41,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:41,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4742 states and 8919 transitions. [2024-10-15 00:08:41,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:08:41,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4742 states to 0 states and 0 transitions. [2024-10-15 00:08:41,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:08:41,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:08:41,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:08:41,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:08:41,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:08:41,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:08:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:41,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 00:08:41,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-15 00:08:41,427 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:41,428 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-15 00:08:41,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-15 00:08:41,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:08:41,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 00:08:41,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:08:41,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:08:41,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:08:41,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:08:41,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:08:41,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:08:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:08:41,429 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:08:41,429 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:08:41,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:08:41,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:08:41,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:08:41,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:08:41 BoogieIcfgContainer [2024-10-15 00:08:41,437 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:08:41,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:08:41,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:08:41,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:08:41,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:33" (3/4) ... [2024-10-15 00:08:41,440 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:08:41,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:08:41,441 INFO L158 Benchmark]: Toolchain (without parser) took 8519.16ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 102.1MB in the beginning and 175.1MB in the end (delta: -73.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-15 00:08:41,442 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:08:41,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.56ms. Allocated memory is still 159.4MB. Free memory was 102.1MB in the beginning and 91.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:08:41,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.42ms. Allocated memory is still 159.4MB. Free memory was 91.9MB in the beginning and 90.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:08:41,442 INFO L158 Benchmark]: Boogie Preprocessor took 27.66ms. Allocated memory is still 159.4MB. Free memory was 90.3MB in the beginning and 89.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:08:41,443 INFO L158 Benchmark]: RCFGBuilder took 212.99ms. Allocated memory is still 159.4MB. Free memory was 89.0MB in the beginning and 80.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-15 00:08:41,443 INFO L158 Benchmark]: BuchiAutomizer took 8037.43ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 80.2MB in the beginning and 176.2MB in the end (delta: -96.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:08:41,443 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 243.3MB. Free memory was 176.2MB in the beginning and 175.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:08:41,444 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.22ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.56ms. Allocated memory is still 159.4MB. Free memory was 102.1MB in the beginning and 91.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.42ms. Allocated memory is still 159.4MB. Free memory was 91.9MB in the beginning and 90.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.66ms. Allocated memory is still 159.4MB. Free memory was 90.3MB in the beginning and 89.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.99ms. Allocated memory is still 159.4MB. Free memory was 89.0MB in the beginning and 80.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8037.43ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 80.2MB in the beginning and 176.2MB in the end (delta: -96.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 243.3MB. Free memory was 176.2MB in the beginning and 175.1MB in the end (delta: 1.0MB). There was no memory consumed. 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 13 terminating modules (5 trivial, 3 deterministic, 5 nondeterministic). One deterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 4 locations. One deterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * n) + 201) and consists of 4 locations. One nondeterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 3 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * n) + 221) and consists of 4 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function c and consists of 9 locations. 5 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 10 iterations. TraceHistogramMax:10. Analysis of lassos took 4.8s. Construction of modules took 0.2s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 9. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 341 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 1, 3, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 84/100 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 130 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-15 00:08:41,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-10-15 00:08:41,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-15 00:08:41,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: TRUE