./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_Recursion.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_Recursion.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 b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:08:33,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:08:33,373 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:33,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:08:33,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:08:33,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:08:33,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:08:33,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:08:33,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:08:33,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:08:33,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:08:33,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:08:33,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:08:33,436 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:08:33,437 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:08:33,437 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:08:33,437 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:08:33,437 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:08:33,437 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:08:33,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:08:33,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:08:33,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:08:33,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:08:33,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:08:33,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:08:33,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:08:33,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:08:33,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:08:33,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:08:33,443 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:08:33,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:08:33,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:08:33,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:08:33,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:08:33,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:08:33,444 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:08:33,446 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 -> b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 [2024-10-15 00:08:33,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:08:33,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:08:33,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:08:33,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:08:33,694 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:08:33,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2024-10-15 00:08:35,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:08:35,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:08:35,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2024-10-15 00:08:35,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb653eb42/0b9f0ce4bf2a4238a27d5e9b6d283ed0/FLAG8a10fc904 [2024-10-15 00:08:35,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb653eb42/0b9f0ce4bf2a4238a27d5e9b6d283ed0 [2024-10-15 00:08:35,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:08:35,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:08:35,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:08:35,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:08:35,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:08:35,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:35" (1/1) ... [2024-10-15 00:08:35,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6204ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:35, skipping insertion in model container [2024-10-15 00:08:35,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:35" (1/1) ... [2024-10-15 00:08:35,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:08:35,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:08:35,339 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:08:35,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:08:35,361 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:08:35,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:35 WrapperNode [2024-10-15 00:08:35,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:08:35,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:08:35,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:08:35,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:08:35,369 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:35" (1/1) ... [2024-10-15 00:08:35,372 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:35" (1/1) ... [2024-10-15 00:08:35,388 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7 [2024-10-15 00:08:35,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:08:35,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:08:35,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:08:35,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:08:35,397 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:35" (1/1) ... [2024-10-15 00:08:35,398 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:35" (1/1) ... [2024-10-15 00:08:35,398 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:35" (1/1) ... [2024-10-15 00:08:35,403 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-15 00:08:35,404 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:35" (1/1) ... [2024-10-15 00:08:35,404 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:35" (1/1) ... [2024-10-15 00:08:35,406 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:35" (1/1) ... [2024-10-15 00:08:35,408 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:35" (1/1) ... [2024-10-15 00:08:35,408 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:35" (1/1) ... [2024-10-15 00:08:35,409 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:35" (1/1) ... [2024-10-15 00:08:35,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:08:35,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:08:35,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:08:35,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:08:35,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:35" (1/1) ... [2024-10-15 00:08:35,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:35,458 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:35,461 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:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:08:35,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:08:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2024-10-15 00:08:35,503 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2024-10-15 00:08:35,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:08:35,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:08:35,639 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 00:08:35,639 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:08:35,649 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:08:35,649 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 00:08:35,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:35 BoogieIcfgContainer [2024-10-15 00:08:35,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:08:35,650 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:08:35,650 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:08:35,654 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:08:35,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:35,654 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:08:35" (1/3) ... [2024-10-15 00:08:35,655 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c8d0dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:08:35, skipping insertion in model container [2024-10-15 00:08:35,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:35,655 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:35" (2/3) ... [2024-10-15 00:08:35,655 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c8d0dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:08:35, skipping insertion in model container [2024-10-15 00:08:35,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:35,656 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:35" (3/3) ... [2024-10-15 00:08:35,657 INFO L332 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Recursion.c [2024-10-15 00:08:35,698 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:08:35,698 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:08:35,698 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:08:35,698 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:08:35,698 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:08:35,699 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:08:35,699 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:08:35,699 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:08:35,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 00:08:35,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:35,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:35,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:35,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:08:35,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:35,726 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:08:35,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 00:08:35,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:35,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:35,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:35,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:08:35,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:35,736 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2#L16true call main_#t~ret3#1 := mc91(main_~x~0#1);< 11#$Ultimate##0true [2024-10-15 00:08:35,737 INFO L747 eck$LassoCheckResult]: Loop: 11#$Ultimate##0true ~n := #in~n; 8#L10true assume !(~n > 100); 9#L11true call #t~ret0 := mc91(11 + ~n);< 11#$Ultimate##0true [2024-10-15 00:08:35,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 29870, now seen corresponding path program 1 times [2024-10-15 00:08:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:35,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706129380] [2024-10-15 00:08:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:35,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 37870, now seen corresponding path program 1 times [2024-10-15 00:08:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852313825] [2024-10-15 00:08:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:35,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 889865249, now seen corresponding path program 1 times [2024-10-15 00:08:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569602687] [2024-10-15 00:08:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:35,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:35,961 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:35,962 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:35,962 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:35,962 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:35,962 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:35,962 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:35,963 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:35,963 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:35,963 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration1_Loop [2024-10-15 00:08:35,963 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:35,963 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:35,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,085 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:36,085 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:36,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,089 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:36,090 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:36,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:36,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,117 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:36,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,119 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:36,120 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:36,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:36,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,151 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:08:36,155 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:36,156 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:36,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:36,156 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:36,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:36,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:36,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:36,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:36,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration1_Loop [2024-10-15 00:08:36,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:36,156 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:36,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,213 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:36,217 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:36,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,220 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:36,222 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:36,223 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,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:36,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:36,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:36,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:36,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:36,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:36,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:36,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:36,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:36,248 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,266 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:36,268 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:36,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:36,269 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:36,270 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:36,271 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2024-10-15 00:08:36,283 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:36,288 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:36,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:36,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:08:36,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:36,420 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,445 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:36,446 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:36,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 39 transitions. Complement of second has 16 states. [2024-10-15 00:08:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:08:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2024-10-15 00:08:36,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2024-10-15 00:08:36,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2024-10-15 00:08:36,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2024-10-15 00:08:36,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:36,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2024-10-15 00:08:36,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:36,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 19 states and 25 transitions. [2024-10-15 00:08:36,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-15 00:08:36,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-15 00:08:36,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2024-10-15 00:08:36,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:36,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-10-15 00:08:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2024-10-15 00:08:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-15 00:08:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 00:08:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-15 00:08:36,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-15 00:08:36,574 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-15 00:08:36,574 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:08:36,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-15 00:08:36,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-15 00:08:36,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:36,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:36,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:08:36,578 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:08:36,578 INFO L745 eck$LassoCheckResult]: Stem: 114#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 107#L16 call main_#t~ret3#1 := mc91(main_~x~0#1);< 109#$Ultimate##0 ~n := #in~n; 112#L10 assume !(~n > 100); 106#L11 call #t~ret0 := mc91(11 + ~n);< 108#$Ultimate##0 ~n := #in~n; 113#L10 assume ~n > 100;#res := ~n - 10; 110#mc91FINAL assume true; 111#mc91EXIT >#20#return; 104#L11-1 [2024-10-15 00:08:36,579 INFO L747 eck$LassoCheckResult]: Loop: 104#L11-1 call #t~ret1 := mc91(#t~ret0);< 105#$Ultimate##0 ~n := #in~n; 118#L10 assume !(~n > 100); 103#L11 call #t~ret0 := mc91(11 + ~n);< 105#$Ultimate##0 ~n := #in~n; 118#L10 assume ~n > 100;#res := ~n - 10; 117#mc91FINAL assume true; 119#mc91EXIT >#20#return; 104#L11-1 [2024-10-15 00:08:36,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1612519912, now seen corresponding path program 1 times [2024-10-15 00:08:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102127703] [2024-10-15 00:08:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash -696734814, now seen corresponding path program 1 times [2024-10-15 00:08:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718130538] [2024-10-15 00:08:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1110240905, now seen corresponding path program 1 times [2024-10-15 00:08:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603492026] [2024-10-15 00:08:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:36,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:36,793 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:36,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:36,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:36,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:36,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:36,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,794 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:36,794 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:36,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration2_Loop [2024-10-15 00:08:36,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:36,794 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:36,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:36,836 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:36,836 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:36,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,838 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:36,839 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:36,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:36,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,857 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:36,858 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:08:36,870 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:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,872 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:36,873 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:36,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:36,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,886 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:08:36,887 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:08:36,898 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:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,901 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:36,902 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:36,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:36,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:36,938 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:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:36,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:36,940 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:36,942 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:36,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:36,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:49,260 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-15 00:08:49,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:49,279 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:49,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:49,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:49,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:49,280 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:49,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:49,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:49,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:49,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration2_Loop [2024-10-15 00:08:49,280 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:49,280 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:49,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:49,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:49,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:49,350 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:49,351 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:49,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:49,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:49,354 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:49,356 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:49,357 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:49,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:49,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:49,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:49,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:49,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:49,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:49,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:49,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:49,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:49,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:49,384 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:49,385 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:49,387 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:49,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:49,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:49,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:49,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:49,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:49,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:49,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:49,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:49,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:08:49,404 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:08:49,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:49,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:49,406 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:49,407 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:49,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:49,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:08:49,410 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:49,410 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2024-10-15 00:08:49,420 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:49,422 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:08:49,431 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret0 [2024-10-15 00:08:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:49,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:49,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:49,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:08:49,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:49,637 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:08:49,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:08:49,783 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 51 states and 73 transitions. Complement of second has 32 states. [2024-10-15 00:08:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:08:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 00:08:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-15 00:08:49,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2024-10-15 00:08:49,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:49,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2024-10-15 00:08:49,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:49,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2024-10-15 00:08:49,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:49,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2024-10-15 00:08:49,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:08:49,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 62 transitions. [2024-10-15 00:08:49,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-15 00:08:49,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-15 00:08:49,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2024-10-15 00:08:49,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:08:49,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-15 00:08:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2024-10-15 00:08:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-15 00:08:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-15 00:08:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2024-10-15 00:08:49,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-15 00:08:49,797 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2024-10-15 00:08:49,798 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:08:49,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2024-10-15 00:08:49,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-15 00:08:49,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:49,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:49,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:08:49,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:49,800 INFO L745 eck$LassoCheckResult]: Stem: 306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 288#L16 call main_#t~ret3#1 := mc91(main_~x~0#1);< 289#$Ultimate##0 ~n := #in~n; 302#L10 assume !(~n > 100); 295#L11 call #t~ret0 := mc91(11 + ~n);< 296#$Ultimate##0 ~n := #in~n; 305#L10 assume ~n > 100;#res := ~n - 10; 321#mc91FINAL assume true; 319#mc91EXIT >#20#return; 293#L11-1 call #t~ret1 := mc91(#t~ret0);< 314#$Ultimate##0 ~n := #in~n; 323#L10 assume !(~n > 100); 290#L11 [2024-10-15 00:08:49,800 INFO L747 eck$LassoCheckResult]: Loop: 290#L11 call #t~ret0 := mc91(11 + ~n);< 291#$Ultimate##0 ~n := #in~n; 315#L10 assume !(~n > 100); 290#L11 [2024-10-15 00:08:49,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash -628486927, now seen corresponding path program 2 times [2024-10-15 00:08:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355585779] [2024-10-15 00:08:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:49,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:49,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:49,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:49,817 INFO L85 PathProgramCache]: Analyzing trace with hash 48310, now seen corresponding path program 2 times [2024-10-15 00:08:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639860717] [2024-10-15 00:08:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:49,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:49,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1491580474, now seen corresponding path program 3 times [2024-10-15 00:08:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805959146] [2024-10-15 00:08:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:49,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:49,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-15 00:08:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 00:08:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:08:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805959146] [2024-10-15 00:08:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805959146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:08:49,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:08:49,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 00:08:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787559736] [2024-10-15 00:08:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:08:50,030 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:50,031 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:50,031 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:50,031 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:50,031 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:08:50,031 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:50,031 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:50,031 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:50,032 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration3_Loop [2024-10-15 00:08:50,032 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:50,032 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:50,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:50,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:50,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:50,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:50,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:50,065 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:08:50,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:50,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:50,067 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:50,068 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:50,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:08:50,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:08:50,102 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:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:50,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:50,104 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:50,105 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:50,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:08:50,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:09:02,142 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-15 00:09:02,152 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:09:02,153 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:09:02,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:09:02,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:09:02,153 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:09:02,153 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:09:02,153 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:02,153 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:09:02,153 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:09:02,153 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration3_Loop [2024-10-15 00:09:02,153 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:09:02,153 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:09:02,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:02,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:02,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:02,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:02,190 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:09:02,190 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:09:02,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:02,195 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:09:02,197 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:09:02,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:09:02,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:09:02,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:09:02,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:09:02,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:09:02,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:09:02,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:09:02,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:09:02,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:09:02,217 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:09:02,217 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:09:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:02,218 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:09:02,219 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:09:02,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:09:02,220 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:09:02,220 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:09:02,220 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2024-10-15 00:09:02,232 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:09:02,233 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:09:02,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:02,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:09:02,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:02,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:09:02,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:02,340 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:09:02,341 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:09:02,341 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2024-10-15 00:09:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-15 00:09:02,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-15 00:09:02,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:02,393 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:09:02,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:02,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:09:02,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:02,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:09:02,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:02,512 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:09:02,513 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:09:02,513 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2024-10-15 00:09:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2024-10-15 00:09:02,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-15 00:09:02,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:02,569 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:09:02,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:02,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 00:09:02,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:02,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:09:02,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:02,671 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:09:02,673 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-15 00:09:02,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 71 states and 100 transitions. Complement of second has 16 states. [2024-10-15 00:09:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2024-10-15 00:09:02,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-15 00:09:02,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:02,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2024-10-15 00:09:02,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:02,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2024-10-15 00:09:02,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:02,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 100 transitions. [2024-10-15 00:09:02,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-15 00:09:02,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 74 transitions. [2024-10-15 00:09:02,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-15 00:09:02,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-15 00:09:02,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2024-10-15 00:09:02,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:09:02,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-10-15 00:09:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2024-10-15 00:09:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2024-10-15 00:09:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-15 00:09:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-10-15 00:09:02,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-10-15 00:09:02,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:09:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:09:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:09:02,753 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:09:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:09:02,827 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-10-15 00:09:02,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2024-10-15 00:09:02,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-15 00:09:02,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 58 states and 75 transitions. [2024-10-15 00:09:02,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:09:02,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-15 00:09:02,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 75 transitions. [2024-10-15 00:09:02,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:09:02,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-10-15 00:09:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 75 transitions. [2024-10-15 00:09:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-10-15 00:09:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 13 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-15 00:09:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-10-15 00:09:02,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-15 00:09:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 00:09:02,838 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-10-15 00:09:02,838 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:09:02,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 74 transitions. [2024-10-15 00:09:02,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-15 00:09:02,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:09:02,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:09:02,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-15 00:09:02,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2024-10-15 00:09:02,841 INFO L745 eck$LassoCheckResult]: Stem: 852#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 853#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 834#L16 call main_#t~ret3#1 := mc91(main_~x~0#1);< 836#$Ultimate##0 ~n := #in~n; 859#L10 assume !(~n > 100); 833#L11 call #t~ret0 := mc91(11 + ~n);< 835#$Ultimate##0 ~n := #in~n; 868#L10 assume !(~n > 100); 864#L11 call #t~ret0 := mc91(11 + ~n);< 866#$Ultimate##0 ~n := #in~n; 869#L10 assume ~n > 100;#res := ~n - 10; 867#mc91FINAL assume true; 865#mc91EXIT >#20#return; 846#L11-1 call #t~ret1 := mc91(#t~ret0);< 844#$Ultimate##0 ~n := #in~n; 847#L10 assume ~n > 100;#res := ~n - 10; 858#mc91FINAL assume true; 884#mc91EXIT >#22#return; 860#L11-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 882#mc91FINAL assume true; 881#mc91EXIT >#20#return; 838#L11-1 call #t~ret1 := mc91(#t~ret0);< 856#$Ultimate##0 [2024-10-15 00:09:02,841 INFO L747 eck$LassoCheckResult]: Loop: 856#$Ultimate##0 ~n := #in~n; 874#L10 assume !(~n > 100); 849#L11 call #t~ret0 := mc91(11 + ~n);< 848#$Ultimate##0 ~n := #in~n; 851#L10 assume !(~n > 100); 850#L11 call #t~ret0 := mc91(11 + ~n);< 870#$Ultimate##0 ~n := #in~n; 880#L10 assume ~n > 100;#res := ~n - 10; 878#mc91FINAL assume true; 876#mc91EXIT >#20#return; 830#L11-1 call #t~ret1 := mc91(#t~ret0);< 873#$Ultimate##0 ~n := #in~n; 871#L10 assume ~n > 100;#res := ~n - 10; 872#mc91FINAL assume true; 883#mc91EXIT >#22#return; 860#L11-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 882#mc91FINAL assume true; 881#mc91EXIT >#20#return; 839#L11-1 call #t~ret1 := mc91(#t~ret0);< 856#$Ultimate##0 [2024-10-15 00:09:02,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1678623115, now seen corresponding path program 1 times [2024-10-15 00:09:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:09:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645708390] [2024-10-15 00:09:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:09:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:09:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:02,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:09:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:02,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:09:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2037590184, now seen corresponding path program 1 times [2024-10-15 00:09:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:09:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681311419] [2024-10-15 00:09:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:09:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:09:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:02,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:09:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:02,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:09:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1698366862, now seen corresponding path program 2 times [2024-10-15 00:09:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:09:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422007086] [2024-10-15 00:09:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:09:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:09:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,037 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:09:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 00:09:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:09:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 00:09:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 00:09:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:09:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 00:09:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 00:09:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:09:03,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422007086] [2024-10-15 00:09:03,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422007086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:09:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947411678] [2024-10-15 00:09:03,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:09:03,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:09:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:03,202 INFO L229 MonitoredProcess]: Starting monitored process 17 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:09:03,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-15 00:09:03,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:09:03,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:09:03,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:09:03,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 00:09:03,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:09:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 00:09:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947411678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:09:03,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:09:03,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2024-10-15 00:09:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666463973] [2024-10-15 00:09:03,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:09:03,622 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:09:03,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:09:03,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:09:03,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:09:03,622 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:09:03,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:03,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:09:03,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:09:03,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration4_Loop [2024-10-15 00:09:03,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:09:03,622 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:09:03,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,651 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:09:03,651 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:09:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:03,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:03,654 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:09:03,655 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:09:03,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:09:03,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:09:03,689 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:09:03,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:03,691 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:09:03,692 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:09:03,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:09:03,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:09:03,706 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-15 00:09:03,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-15 00:09:03,718 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:09:03,718 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:09:03,718 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:09:03,718 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:09:03,718 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:09:03,719 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:03,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:09:03,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:09:03,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration4_Loop [2024-10-15 00:09:03,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:09:03,719 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:09:03,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:03,751 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:09:03,751 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:09:03,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:03,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:03,753 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:09:03,754 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:09:03,757 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:09:03,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:09:03,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:09:03,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:09:03,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:09:03,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:09:03,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:09:03,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:09:03,770 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:09:03,772 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:09:03,772 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:09:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:03,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:03,774 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:09:03,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-15 00:09:03,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:09:03,776 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:09:03,776 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:09:03,776 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2024-10-15 00:09:03,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-15 00:09:03,788 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:09:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:09:03,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:03,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 00:09:03,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:04,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-15 00:09:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 00:09:04,153 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-15 00:09:04,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:09:04,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 49 states. [2024-10-15 00:09:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:09:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2024-10-15 00:09:04,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-15 00:09:04,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:04,466 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:09:04,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:04,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:09:04,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:04,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 00:09:04,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 00:09:04,816 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-15 00:09:04,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:09:05,098 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 49 states. [2024-10-15 00:09:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:09:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2024-10-15 00:09:05,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-15 00:09:05,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:05,101 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:09:05,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:05,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 00:09:05,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:05,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 00:09:05,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 00:09:05,440 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2024-10-15 00:09:05,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:09:06,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 431 states and 531 transitions. Complement of second has 224 states. [2024-10-15 00:09:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 18 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 00:09:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2024-10-15 00:09:06,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 19 letters. [2024-10-15 00:09:06,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:06,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 41 letters. Loop has 19 letters. [2024-10-15 00:09:06,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:06,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 50 transitions. Stem has 22 letters. Loop has 38 letters. [2024-10-15 00:09:06,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:06,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 531 transitions. [2024-10-15 00:09:06,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2024-10-15 00:09:06,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 203 states and 269 transitions. [2024-10-15 00:09:06,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-15 00:09:06,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2024-10-15 00:09:06,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 269 transitions. [2024-10-15 00:09:06,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:09:06,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 203 states and 269 transitions. [2024-10-15 00:09:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 269 transitions. [2024-10-15 00:09:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 157. [2024-10-15 00:09:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 97 states have (on average 1.092783505154639) internal successors, (106), 99 states have internal predecessors, (106), 35 states have call successors, (45), 29 states have call predecessors, (45), 25 states have return successors, (47), 28 states have call predecessors, (47), 32 states have call successors, (47) [2024-10-15 00:09:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2024-10-15 00:09:06,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 198 transitions. [2024-10-15 00:09:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:09:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 00:09:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-15 00:09:06,081 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-15 00:09:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:09:06,245 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2024-10-15 00:09:06,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 188 transitions. [2024-10-15 00:09:06,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:09:06,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 104 states and 123 transitions. [2024-10-15 00:09:06,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-10-15 00:09:06,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-10-15 00:09:06,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 123 transitions. [2024-10-15 00:09:06,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:09:06,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 123 transitions. [2024-10-15 00:09:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 123 transitions. [2024-10-15 00:09:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-10-15 00:09:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 64 states have internal predecessors, (66), 21 states have call successors, (28), 20 states have call predecessors, (28), 16 states have return successors, (25), 15 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-15 00:09:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-10-15 00:09:06,254 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-15 00:09:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 00:09:06,258 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-10-15 00:09:06,258 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:09:06,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 119 transitions. [2024-10-15 00:09:06,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-15 00:09:06,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:09:06,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:09:06,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2024-10-15 00:09:06,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:09:06,260 INFO L745 eck$LassoCheckResult]: Stem: 3030#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3009#L16 call main_#t~ret3#1 := mc91(main_~x~0#1);< 3010#$Ultimate##0 ~n := #in~n; 3048#L10 assume !(~n > 100); 3049#L11 call #t~ret0 := mc91(11 + ~n);< 3050#$Ultimate##0 ~n := #in~n; 3052#L10 assume !(~n > 100); 3051#L11 call #t~ret0 := mc91(11 + ~n);< 3068#$Ultimate##0 ~n := #in~n; 3070#L10 assume ~n > 100;#res := ~n - 10; 3069#mc91FINAL assume true; 3067#mc91EXIT >#20#return; 3064#L11-1 call #t~ret1 := mc91(#t~ret0);< 3066#$Ultimate##0 ~n := #in~n; 3072#L10 assume ~n > 100;#res := ~n - 10; 3071#mc91FINAL assume true; 3063#mc91EXIT >#22#return; 3061#L11-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 3059#mc91FINAL assume true; 3058#mc91EXIT >#20#return; 3053#L11-1 call #t~ret1 := mc91(#t~ret0);< 3057#$Ultimate##0 ~n := #in~n; 3055#L10 assume !(~n > 100); 3015#L11 call #t~ret0 := mc91(11 + ~n);< 3017#$Ultimate##0 ~n := #in~n; 3060#L10 assume !(~n > 100); 3014#L11 call #t~ret0 := mc91(11 + ~n);< 3016#$Ultimate##0 ~n := #in~n; 3108#L10 assume ~n > 100;#res := ~n - 10; 3104#mc91FINAL assume true; 3103#mc91EXIT >#20#return; 3012#L11-1 [2024-10-15 00:09:06,260 INFO L747 eck$LassoCheckResult]: Loop: 3012#L11-1 call #t~ret1 := mc91(#t~ret0);< 3036#$Ultimate##0 ~n := #in~n; 3105#L10 assume !(~n > 100); 3011#L11 call #t~ret0 := mc91(11 + ~n);< 3013#$Ultimate##0 ~n := #in~n; 3107#L10 assume ~n > 100;#res := ~n - 10; 3106#mc91FINAL assume true; 3102#mc91EXIT >#20#return; 3012#L11-1 [2024-10-15 00:09:06,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1028640846, now seen corresponding path program 3 times [2024-10-15 00:09:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:09:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055565860] [2024-10-15 00:09:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:09:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:09:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 00:09:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:06,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:09:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 00:09:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 00:09:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-15 00:09:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:09:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055565860] [2024-10-15 00:09:06,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055565860] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:09:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892426867] [2024-10-15 00:09:06,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:09:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:09:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:06,393 INFO L229 MonitoredProcess]: Starting monitored process 22 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:09:06,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-15 00:09:06,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-15 00:09:06,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:09:06,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 00:09:06,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 00:09:06,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 00:09:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892426867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:09:06,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 00:09:06,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2024-10-15 00:09:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259547596] [2024-10-15 00:09:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:09:06,446 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:09:06,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash -696734814, now seen corresponding path program 2 times [2024-10-15 00:09:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:09:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573928330] [2024-10-15 00:09:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:09:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:09:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:06,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:09:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:06,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:09:06,525 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:09:06,525 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:09:06,525 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:09:06,526 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:09:06,526 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-15 00:09:06,526 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:06,526 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:09:06,526 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:09:06,526 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration5_Loop [2024-10-15 00:09:06,526 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:09:06,526 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:09:06,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:06,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:06,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:06,561 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:09:06,562 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-15 00:09:06,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:06,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:06,563 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:09:06,564 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:09:06,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:09:06,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:09:06,576 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-15 00:09:06,576 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-15 00:09:06,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-15 00:09:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:06,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:06,590 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:09:06,591 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:09:06,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-15 00:09:06,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:09:06,624 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:09:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:06,625 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:09:06,626 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:09:06,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-15 00:09:06,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-15 00:09:18,675 INFO L403 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2024-10-15 00:09:18,687 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:09:18,687 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:09:18,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:09:18,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:09:18,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:09:18,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:09:18,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:18,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:09:18,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:09:18,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration5_Loop [2024-10-15 00:09:18,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:09:18,688 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:09:18,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:18,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:18,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:09:18,721 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:09:18,722 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:09:18,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:18,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:18,724 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:09:18,725 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:09:18,726 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:09:18,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:09:18,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:09:18,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:09:18,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:09:18,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:09:18,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:09:18,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:09:18,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:09:18,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-15 00:09:18,742 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-15 00:09:18,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:09:18,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:09:18,744 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:09:18,745 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:09:18,745 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:09:18,745 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-15 00:09:18,745 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:09:18,745 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2024-10-15 00:09:18,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-15 00:09:18,759 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-15 00:09:18,763 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret0 [2024-10-15 00:09:18,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:18,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:09:18,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:18,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:09:18,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:09:19,024 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:09:19,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:09:19,144 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2024-10-15 00:09:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:09:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-15 00:09:19,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-15 00:09:19,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:19,147 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:09:19,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:19,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:09:19,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:19,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-15 00:09:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:19,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:09:19,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:09:19,404 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:09:19,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:09:19,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 139 states and 161 transitions. Complement of second has 24 states. [2024-10-15 00:09:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:09:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2024-10-15 00:09:19,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-15 00:09:19,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:19,522 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-15 00:09:19,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:09:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:19,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:09:19,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:09:19,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 00:09:19,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:09:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:09:19,755 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2024-10-15 00:09:19,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:09:19,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 119 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 181 states and 211 transitions. Complement of second has 27 states. [2024-10-15 00:09:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-10-15 00:09:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:09:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2024-10-15 00:09:19,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 8 letters. [2024-10-15 00:09:19,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:19,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 40 letters. Loop has 8 letters. [2024-10-15 00:09:19,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:19,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 32 letters. Loop has 16 letters. [2024-10-15 00:09:19,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:09:19,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 211 transitions. [2024-10-15 00:09:19,887 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:09:19,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 0 states and 0 transitions. [2024-10-15 00:09:19,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:09:19,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:09:19,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:09:19,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:09:19,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:09:19,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:09:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:09:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 00:09:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-15 00:09:19,888 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 5 states have internal predecessors, (16), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 00:09:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:09:19,888 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:09:19,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-15 00:09:19,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-15 00:09:19,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:09:19,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 00:09:19,888 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 00:09:19,888 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:09:19,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-15 00:09:19,889 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-15 00:09:19,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-15 00:09:19,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:09:19 BoogieIcfgContainer [2024-10-15 00:09:19,895 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:09:19,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:09:19,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:09:19,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:09:19,896 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:35" (3/4) ... [2024-10-15 00:09:19,898 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-15 00:09:19,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:09:19,900 INFO L158 Benchmark]: Toolchain (without parser) took 44698.34ms. Allocated memory is still 199.2MB. Free memory was 131.3MB in the beginning and 89.8MB in the end (delta: 41.5MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-10-15 00:09:19,900 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:09:19,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.74ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 121.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:09:19,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.61ms. Allocated memory is still 199.2MB. Free memory was 121.0MB in the beginning and 119.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:09:19,900 INFO L158 Benchmark]: Boogie Preprocessor took 20.83ms. Allocated memory is still 199.2MB. Free memory was 119.6MB in the beginning and 118.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:09:19,901 INFO L158 Benchmark]: RCFGBuilder took 238.85ms. Allocated memory is still 199.2MB. Free memory was 118.5MB in the beginning and 108.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:09:19,901 INFO L158 Benchmark]: BuchiAutomizer took 44245.01ms. Allocated memory is still 199.2MB. Free memory was 108.0MB in the beginning and 89.8MB in the end (delta: 18.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-10-15 00:09:19,901 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 199.2MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:09:19,902 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.51ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.74ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 121.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.61ms. Allocated memory is still 199.2MB. Free memory was 121.0MB in the beginning and 119.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.83ms. Allocated memory is still 199.2MB. Free memory was 119.6MB in the beginning and 118.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.85ms. Allocated memory is still 199.2MB. Free memory was 118.5MB in the beginning and 108.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 44245.01ms. Allocated memory is still 199.2MB. Free memory was 108.0MB in the beginning and 89.8MB in the end (delta: 18.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 199.2MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (211 + ((long) -2 * \old(n))) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. One nondeterministic module has affine ranking function (((long) -2 * n) + 189) and consists of 6 locations. One nondeterministic module has affine ranking function (90 + ((long) -1 * \old(n))) and consists of 21 locations. One nondeterministic module has affine ranking function null and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.2s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 39.3s. Construction of modules took 0.6s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 170 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf90 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 52ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 36.6s 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:09:19,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-15 00:09:20,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-15 00:09:20,331 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