./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.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.graphml --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 871be16186d4378aec884efd2352a47ca4eb57bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:13:40,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:13:40,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:13:40,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:13:40,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:13:40,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:13:40,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:13:40,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:13:40,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:13:40,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:13:40,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:13:40,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:13:40,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:13:40,046 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:13:40,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:13:40,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:13:40,049 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:13:40,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:13:40,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:13:40,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:13:40,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:13:40,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:13:40,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:13:40,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:13:40,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:13:40,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:13:40,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:13:40,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:13:40,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:13:40,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:13:40,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:13:40,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:13:40,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:13:40,084 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:13:40,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:13:40,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:13:40,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:13:40,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:13:40,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:13:40,120 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:13:40,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:13:40,121 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:13:40,121 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:13:40,121 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:13:40,121 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:13:40,122 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:13:40,122 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:13:40,122 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:13:40,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:13:40,122 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:13:40,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:13:40,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:13:40,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:13:40,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:13:40,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:13:40,123 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:13:40,123 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:13:40,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:13:40,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:13:40,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:13:40,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:13:40,126 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:13:40,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:13:40,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:13:40,127 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:13:40,128 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:13:40,129 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.graphml 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 -> 871be16186d4378aec884efd2352a47ca4eb57bc [2018-11-28 23:13:40,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:13:40,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:13:40,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:13:40,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:13:40,210 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:13:40,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:13:40,271 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4118d3a9f/2ddbe250f1264151bb8fe9d39412436e/FLAG29e2b3595 [2018-11-28 23:13:40,770 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:13:40,770 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:13:40,776 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4118d3a9f/2ddbe250f1264151bb8fe9d39412436e/FLAG29e2b3595 [2018-11-28 23:13:41,092 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4118d3a9f/2ddbe250f1264151bb8fe9d39412436e [2018-11-28 23:13:41,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:13:41,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:13:41,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:13:41,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:13:41,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:13:41,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558208ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41, skipping insertion in model container [2018-11-28 23:13:41,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:13:41,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:13:41,354 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:13:41,359 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:13:41,375 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:13:41,391 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:13:41,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41 WrapperNode [2018-11-28 23:13:41,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:13:41,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:13:41,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:13:41,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:13:41,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:13:41,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:13:41,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:13:41,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:13:41,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... [2018-11-28 23:13:41,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:13:41,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:13:41,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:13:41,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:13:41,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:41,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:13:41,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:13:41,594 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2018-11-28 23:13:41,594 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2018-11-28 23:13:41,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:13:41,801 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 23:13:41,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:41 BoogieIcfgContainer [2018-11-28 23:13:41,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:13:41,802 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:13:41,803 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:13:41,807 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:13:41,808 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:41,808 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:13:41" (1/3) ... [2018-11-28 23:13:41,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779b8f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:13:41, skipping insertion in model container [2018-11-28 23:13:41,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:41,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:41" (2/3) ... [2018-11-28 23:13:41,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779b8f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:13:41, skipping insertion in model container [2018-11-28 23:13:41,810 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:41,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:41" (3/3) ... [2018-11-28 23:13:41,812 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:13:41,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:13:41,870 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:13:41,871 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:13:41,871 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:13:41,871 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:13:41,871 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:13:41,871 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:13:41,871 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:13:41,871 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:13:41,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:13:41,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:41,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:41,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:41,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:13:41,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:41,926 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:13:41,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:13:41,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:41,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:41,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:41,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:13:41,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:41,941 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L16true call main_#t~ret3 := mc91(main_~x~0);< 5#mc91ENTRYtrue [2018-11-28 23:13:41,941 INFO L796 eck$LassoCheckResult]: Loop: 5#mc91ENTRYtrue ~n := #in~n; 9#L10true assume !(~n > 100); 11#L11true call #t~ret0 := mc91(11 + ~n);< 5#mc91ENTRYtrue [2018-11-28 23:13:41,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2018-11-28 23:13:41,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:41,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:42,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash 36877, now seen corresponding path program 1 times [2018-11-28 23:13:42,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:42,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:42,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 30036414, now seen corresponding path program 1 times [2018-11-28 23:13:42,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:42,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:42,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,273 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 23:13:42,368 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:42,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:42,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:42,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:42,370 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:42,370 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,370 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:42,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:42,372 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-28 23:13:42,372 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:42,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:42,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:42,547 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:42,552 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:42,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:42,604 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:42,606 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:42,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:42,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:42,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:42,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:42,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:42,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:42,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-28 23:13:42,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:42,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:42,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,909 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:42,913 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:42,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:42,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:42,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:42,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:42,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:42,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:42,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:42,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:42,931 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:42,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:42,940 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:13:42,942 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:42,942 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:42,943 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:42,944 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2018-11-28 23:13:42,945 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:43,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:43,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:43,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:43,253 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:13:43,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-28 23:13:43,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 12 states. [2018-11-28 23:13:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:13:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-28 23:13:43,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-28 23:13:43,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:43,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:13:43,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:43,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:13:43,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:43,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-28 23:13:43,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:43,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 18 states and 24 transitions. [2018-11-28 23:13:43,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:13:43,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:13:43,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-28 23:13:43,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:43,613 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-28 23:13:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-28 23:13:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-28 23:13:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:13:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 23:13:43,645 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:13:43,645 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:13:43,645 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:13:43,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 23:13:43,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:43,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:43,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:43,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:13:43,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:13:43,649 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 96#L16 call main_#t~ret3 := mc91(main_~x~0);< 101#mc91ENTRY ~n := #in~n; 105#L10 assume !(~n > 100); 98#L11 call #t~ret0 := mc91(11 + ~n);< 107#mc91ENTRY ~n := #in~n; 103#L10 assume ~n > 100;#res := ~n - 10; 104#mc91FINAL assume true; 102#mc91EXIT >#19#return; 97#L11-1 [2018-11-28 23:13:43,649 INFO L796 eck$LassoCheckResult]: Loop: 97#L11-1 call #t~ret1 := mc91(#t~ret0);< 106#mc91ENTRY ~n := #in~n; 109#L10 assume !(~n > 100); 95#L11 call #t~ret0 := mc91(11 + ~n);< 106#mc91ENTRY ~n := #in~n; 109#L10 assume ~n > 100;#res := ~n - 10; 99#mc91FINAL assume true; 108#mc91EXIT >#19#return; 97#L11-1 [2018-11-28 23:13:43,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1934452539, now seen corresponding path program 1 times [2018-11-28 23:13:43,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 1 times [2018-11-28 23:13:43,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:43,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 418213862, now seen corresponding path program 1 times [2018-11-28 23:13:43,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:43,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,093 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:13:44,106 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:44,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:44,106 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:44,106 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:44,106 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:44,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:44,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:44,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:44,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-28 23:13:44,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:44,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:44,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,300 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:44,300 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:44,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:44,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:44,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:44,309 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:44,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:44,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:44,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:44,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:13:44,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:44,370 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:13:44,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:44,444 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:56,501 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:13:56,505 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:56,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:56,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:56,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:56,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:56,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:56,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:56,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:56,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-28 23:13:56,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:56,506 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:56,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:56,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:56,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:56,679 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:56,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:56,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:56,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:56,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:56,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:56,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:56,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:56,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:56,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:56,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:56,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:56,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:56,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:56,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:56,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:56,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:56,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:56,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:56,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:56,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:56,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:56,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:56,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:56,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:56,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:56,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:56,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:56,704 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:56,712 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:56,713 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:13:56,713 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:56,713 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:56,714 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:56,714 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2018-11-28 23:13:56,714 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:56,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:56,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:57,067 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 23:13:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:57,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:57,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-28 23:13:57,269 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-28 23:13:57,680 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-11-28 23:13:58,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 50 states and 72 transitions. Complement of second has 32 states. [2018-11-28 23:13:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:13:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-28 23:13:58,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-28 23:13:58,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:58,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-28 23:13:58,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:58,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-28 23:13:58,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:58,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2018-11-28 23:13:58,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:13:58,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 61 transitions. [2018-11-28 23:13:58,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:13:58,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:13:58,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2018-11-28 23:13:58,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:58,127 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-28 23:13:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2018-11-28 23:13:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-11-28 23:13:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:13:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-11-28 23:13:58,136 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-28 23:13:58,137 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-28 23:13:58,137 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:13:58,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-11-28 23:13:58,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:13:58,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:58,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:58,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:13:58,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:13:58,140 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 283#L16 call main_#t~ret3 := mc91(main_~x~0);< 289#mc91ENTRY ~n := #in~n; 295#L10 assume !(~n > 100); 284#L11 call #t~ret0 := mc91(11 + ~n);< 297#mc91ENTRY ~n := #in~n; 300#L10 assume ~n > 100;#res := ~n - 10; 306#mc91FINAL assume true; 305#mc91EXIT >#19#return; 277#L11-1 call #t~ret1 := mc91(#t~ret0);< 292#mc91ENTRY ~n := #in~n; 309#L10 assume !(~n > 100); 294#L11 [2018-11-28 23:13:58,140 INFO L796 eck$LassoCheckResult]: Loop: 294#L11 call #t~ret0 := mc91(11 + ~n);< 296#mc91ENTRY ~n := #in~n; 293#L10 assume !(~n > 100); 294#L11 [2018-11-28 23:13:58,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash 595607827, now seen corresponding path program 2 times [2018-11-28 23:13:58,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:58,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:58,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:58,155 INFO L82 PathProgramCache]: Analyzing trace with hash 47317, now seen corresponding path program 2 times [2018-11-28 23:13:58,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:58,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:58,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:58,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:58,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:58,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891907, now seen corresponding path program 3 times [2018-11-28 23:13:58,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:58,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:58,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:58,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:13:58,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:13:58,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:13:58,339 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:58,339 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:58,339 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:58,339 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:58,340 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:58,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:58,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:58,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-28 23:13:58,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:58,340 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:58,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:58,430 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:58,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:58,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:58,438 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:58,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:58,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:58,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:58,487 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:58,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:10,551 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:14:10,555 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:10,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:10,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:10,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:10,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:10,556 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:10,556 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:10,556 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:10,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-28 23:14:10,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:10,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:10,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:10,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:10,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:10,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:10,626 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:10,627 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:10,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:10,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:10,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:10,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:10,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:10,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:10,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:10,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:10,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:10,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:10,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:10,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:10,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:10,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:10,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:10,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:10,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:10,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:10,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:10,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:10,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:10,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:10,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:10,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:10,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:10,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:10,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:10,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:10,654 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:10,655 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:10,655 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:10,656 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:10,656 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2018-11-28 23:14:10,656 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:10,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:10,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:10,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:10,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:14:10,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-28 23:14:10,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2018-11-28 23:14:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:14:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-28 23:14:10,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:14:10,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:10,940 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:10,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:10,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:11,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:11,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 23:14:11,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-28 23:14:11,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2018-11-28 23:14:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:14:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-28 23:14:11,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:14:11,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:11,176 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:11,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:11,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:11,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:11,361 INFO L152 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 [2018-11-28 23:14:11,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-28 23:14:11,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 70 states and 99 transitions. Complement of second has 16 states. [2018-11-28 23:14:11,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:14:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-28 23:14:11,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:14:11,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:11,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:14:11,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:11,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-28 23:14:11,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:11,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 99 transitions. [2018-11-28 23:14:11,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:14:11,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 73 transitions. [2018-11-28 23:14:11,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:14:11,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 23:14:11,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2018-11-28 23:14:11,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:11,593 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-11-28 23:14:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2018-11-28 23:14:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-28 23:14:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 23:14:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-11-28 23:14:11,600 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2018-11-28 23:14:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:14:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:14:11,604 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 8 states. [2018-11-28 23:14:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:11,761 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-28 23:14:11,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:14:11,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2018-11-28 23:14:11,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:14:11,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 74 transitions. [2018-11-28 23:14:11,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-28 23:14:11,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-28 23:14:11,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2018-11-28 23:14:11,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:11,768 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-11-28 23:14:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2018-11-28 23:14:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 23:14:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 23:14:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-11-28 23:14:11,775 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-11-28 23:14:11,776 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-11-28 23:14:11,776 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:14:11,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2018-11-28 23:14:11,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:14:11,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:11,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:11,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:14:11,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2018-11-28 23:14:11,779 INFO L794 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 815#L16 call main_#t~ret3 := mc91(main_~x~0);< 816#mc91ENTRY ~n := #in~n; 842#L10 assume !(~n > 100); 834#L11 call #t~ret0 := mc91(11 + ~n);< 838#mc91ENTRY ~n := #in~n; 840#L10 assume !(~n > 100); 835#L11 call #t~ret0 := mc91(11 + ~n);< 837#mc91ENTRY ~n := #in~n; 841#L10 assume ~n > 100;#res := ~n - 10; 839#mc91FINAL assume true; 836#mc91EXIT >#19#return; 804#L11-1 call #t~ret1 := mc91(#t~ret0);< 821#mc91ENTRY ~n := #in~n; 855#L10 assume ~n > 100;#res := ~n - 10; 853#mc91FINAL assume true; 851#mc91EXIT >#21#return; 811#L11-2 #res := #t~ret1;havoc #t~ret1;havoc #t~ret0; 848#mc91FINAL assume true; 847#mc91EXIT >#19#return; 809#L11-1 call #t~ret1 := mc91(#t~ret0);< 846#mc91ENTRY [2018-11-28 23:14:11,780 INFO L796 eck$LassoCheckResult]: Loop: 846#mc91ENTRY ~n := #in~n; 843#L10 assume !(~n > 100); 818#L11 call #t~ret0 := mc91(11 + ~n);< 827#mc91ENTRY ~n := #in~n; 824#L10 assume !(~n > 100); 817#L11 call #t~ret0 := mc91(11 + ~n);< 828#mc91ENTRY ~n := #in~n; 822#L10 assume ~n > 100;#res := ~n - 10; 823#mc91FINAL assume true; 857#mc91EXIT >#19#return; 805#L11-1 call #t~ret1 := mc91(#t~ret0);< 819#mc91ENTRY ~n := #in~n; 844#L10 assume ~n > 100;#res := ~n - 10; 845#mc91FINAL assume true; 849#mc91EXIT >#21#return; 811#L11-2 #res := #t~ret1;havoc #t~ret1;havoc #t~ret0; 848#mc91FINAL assume true; 847#mc91EXIT >#19#return; 810#L11-1 call #t~ret1 := mc91(#t~ret0);< 846#mc91ENTRY [2018-11-28 23:14:11,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:11,780 INFO L82 PathProgramCache]: Analyzing trace with hash -104606680, now seen corresponding path program 1 times [2018-11-28 23:14:11,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:11,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:11,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:11,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:11,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:11,797 INFO L82 PathProgramCache]: Analyzing trace with hash -735472521, now seen corresponding path program 1 times [2018-11-28 23:14:11,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:11,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:11,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:11,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:11,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:11,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash -726341392, now seen corresponding path program 2 times [2018-11-28 23:14:11,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:11,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:11,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 23:14:11,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:14:11,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:14:11,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:14:11,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:14:11,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:14:11,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-28 23:14:12,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:14:12,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 23:14:12,234 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:14:12,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:12,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:12,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:12,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:12,524 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:12,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:12,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:12,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-28 23:14:12,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:12,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:12,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:12,618 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:12,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:12,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:12,626 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:12,647 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:12,649 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:12,650 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:12,672 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:12,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:12,674 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:12,696 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:12,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:12,758 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:12,760 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:12,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:12,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:12,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:12,760 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:12,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:12,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:12,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:12,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-28 23:14:12,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:12,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:12,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:12,844 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:12,844 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:12,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:12,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:12,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:12,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:12,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:12,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:12,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:12,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:12,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:12,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:12,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:12,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:12,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:12,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:12,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:12,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:12,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:12,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:12,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:12,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:12,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:12,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:12,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:12,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:12,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:12,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:12,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:12,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:12,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:12,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:12,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:12,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:12,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:12,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:12,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:12,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:12,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:12,863 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:12,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:12,863 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:12,863 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:12,863 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2018-11-28 23:14:12,864 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:12,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:12,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:13,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 23:14:13,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-28 23:14:13,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-28 23:14:14,071 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2018-11-28 23:14:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-28 23:14:14,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-28 23:14:14,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:14,074 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:14,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:14,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 23:14:14,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-28 23:14:14,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-28 23:14:15,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2018-11-28 23:14:15,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-28 23:14:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-28 23:14:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:15,007 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:15,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:15,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:15,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 23:14:15,381 INFO L152 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 [2018-11-28 23:14:15,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-28 23:14:16,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 430 states and 530 transitions. Complement of second has 216 states. [2018-11-28 23:14:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:14:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2018-11-28 23:14:16,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-28 23:14:16,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:16,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 40 letters. Loop has 19 letters. [2018-11-28 23:14:16,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:16,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 38 letters. [2018-11-28 23:14:16,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:16,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 530 transitions. [2018-11-28 23:14:16,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-28 23:14:16,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 202 states and 268 transitions. [2018-11-28 23:14:16,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-11-28 23:14:16,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-28 23:14:16,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 268 transitions. [2018-11-28 23:14:16,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:16,618 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 268 transitions. [2018-11-28 23:14:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 268 transitions. [2018-11-28 23:14:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2018-11-28 23:14:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-28 23:14:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2018-11-28 23:14:16,639 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 197 transitions. [2018-11-28 23:14:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:14:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:14:16,640 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand 9 states. [2018-11-28 23:14:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:16,947 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2018-11-28 23:14:16,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:14:16,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 187 transitions. [2018-11-28 23:14:16,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:14:16,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 103 states and 122 transitions. [2018-11-28 23:14:16,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-28 23:14:16,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-28 23:14:16,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2018-11-28 23:14:16,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:16,957 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-28 23:14:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2018-11-28 23:14:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-28 23:14:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 23:14:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-11-28 23:14:16,966 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-28 23:14:16,966 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-28 23:14:16,966 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:14:16,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2018-11-28 23:14:16,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:14:16,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:16,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:16,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2018-11-28 23:14:16,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:16,971 INFO L794 eck$LassoCheckResult]: Stem: 2791#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 2792#L16 call main_#t~ret3 := mc91(main_~x~0);< 2793#mc91ENTRY ~n := #in~n; 2835#L10 assume !(~n > 100); 2810#L11 call #t~ret0 := mc91(11 + ~n);< 2811#mc91ENTRY ~n := #in~n; 2829#L10 assume !(~n > 100); 2823#L11 call #t~ret0 := mc91(11 + ~n);< 2827#mc91ENTRY ~n := #in~n; 2830#L10 assume ~n > 100;#res := ~n - 10; 2828#mc91FINAL assume true; 2826#mc91EXIT >#19#return; 2822#L11-1 call #t~ret1 := mc91(#t~ret0);< 2825#mc91ENTRY ~n := #in~n; 2852#L10 assume ~n > 100;#res := ~n - 10; 2844#mc91FINAL assume true; 2843#mc91EXIT >#21#return; 2841#L11-2 #res := #t~ret1;havoc #t~ret1;havoc #t~ret0; 2840#mc91FINAL assume true; 2839#mc91EXIT >#19#return; 2831#L11-1 call #t~ret1 := mc91(#t~ret0);< 2838#mc91ENTRY ~n := #in~n; 2836#L10 assume !(~n > 100); 2803#L11 call #t~ret0 := mc91(11 + ~n);< 2812#mc91ENTRY ~n := #in~n; 2802#L10 assume !(~n > 100); 2795#L11 call #t~ret0 := mc91(11 + ~n);< 2834#mc91ENTRY ~n := #in~n; 2883#L10 assume ~n > 100;#res := ~n - 10; 2882#mc91FINAL assume true; 2794#mc91EXIT >#19#return; 2796#L11-1 [2018-11-28 23:14:16,971 INFO L796 eck$LassoCheckResult]: Loop: 2796#L11-1 call #t~ret1 := mc91(#t~ret0);< 2804#mc91ENTRY ~n := #in~n; 2819#L10 assume !(~n > 100); 2808#L11 call #t~ret0 := mc91(11 + ~n);< 2809#mc91ENTRY ~n := #in~n; 2881#L10 assume ~n > 100;#res := ~n - 10; 2880#mc91FINAL assume true; 2879#mc91EXIT >#19#return; 2796#L11-1 [2018-11-28 23:14:16,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1788916079, now seen corresponding path program 3 times [2018-11-28 23:14:16,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:16,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:14:17,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:14:17,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:14:17,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:14:17,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 23:14:17,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:14:17,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 23:14:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:14:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2018-11-28 23:14:17,188 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:14:17,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 2 times [2018-11-28 23:14:17,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:17,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:17,307 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:17,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:17,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:17,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:17,308 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:17,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:17,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:17,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:17,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-28 23:14:17,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:17,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:17,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:17,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:17,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:17,406 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:17,406 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:17,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:17,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:17,417 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:17,417 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:17,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:17,438 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:17,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:17,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:29,501 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:14:29,506 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:29,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:29,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:29,506 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:29,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:29,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:29,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:29,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:29,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-28 23:14:29,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:29,507 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:29,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:29,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:29,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:29,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:29,561 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:29,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:29,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:29,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:29,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:29,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:29,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:29,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:29,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:29,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:29,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:29,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:29,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:29,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:29,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:29,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:29,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:29,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:29,579 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:29,583 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:29,583 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:14:29,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:29,584 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:29,584 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:29,584 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2018-11-28 23:14:29,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:29,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:29,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:29,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:29,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-28 23:14:29,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-28 23:14:30,153 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2018-11-28 23:14:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:14:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-28 23:14:30,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-28 23:14:30,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:30,156 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:30,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:30,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:30,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:30,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-28 23:14:30,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-28 23:14:30,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2018-11-28 23:14:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:14:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-28 23:14:30,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-28 23:14:30,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:30,628 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:30,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:30,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:30,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:30,818 INFO L152 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 [2018-11-28 23:14:30,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-28 23:14:31,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 180 states and 210 transitions. Complement of second has 27 states. [2018-11-28 23:14:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:14:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-28 23:14:31,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-28 23:14:31,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:31,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 39 letters. Loop has 8 letters. [2018-11-28 23:14:31,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:31,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 16 letters. [2018-11-28 23:14:31,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:31,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 210 transitions. [2018-11-28 23:14:31,123 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:31,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2018-11-28 23:14:31,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:14:31,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:14:31,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:14:31,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:31,126 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:31,126 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:31,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:14:31,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:14:31,126 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2018-11-28 23:14:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:31,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:14:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:14:31,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:14:31,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:31,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:14:31,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:14:31,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:14:31,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:14:31,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:31,131 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:31,131 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:31,132 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:31,135 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:14:31,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:14:31,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:31,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:14:31,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:14:31 BoogieIcfgContainer [2018-11-28 23:14:31,151 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:14:31,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:14:31,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:14:31,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:14:31,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:41" (3/4) ... [2018-11-28 23:14:31,165 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:14:31,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:14:31,166 INFO L168 Benchmark]: Toolchain (without parser) took 50068.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 290.5 MB). Free memory was 946.0 MB in the beginning and 877.1 MB in the end (delta: 68.9 MB). Peak memory consumption was 359.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:31,167 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:31,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.41 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:31,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:31,174 INFO L168 Benchmark]: Boogie Preprocessor took 20.58 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:31,175 INFO L168 Benchmark]: RCFGBuilder took 350.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:31,178 INFO L168 Benchmark]: BuchiAutomizer took 49348.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 877.1 MB in the end (delta: 218.1 MB). Peak memory consumption was 397.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:31,181 INFO L168 Benchmark]: Witness Printer took 14.12 ms. Allocated memory is still 1.3 GB. Free memory is still 877.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:31,187 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.41 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.58 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 350.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49348.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 877.1 MB in the end (delta: 218.1 MB). Peak memory consumption was 397.4 MB. Max. memory is 11.5 GB. * Witness Printer took 14.12 ms. Allocated memory is still 1.3 GB. Free memory is still 877.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 -2 * \old(n) + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * aux-mc91(n+11)-aux + 201 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * n + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) + 90 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * aux-mc91(n+11)-aux + 201 and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.2s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 40.3s. Construction of modules took 1.5s. Büchi inclusion checks took 7.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 99 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/24 HoareTripleCheckerStatistics: 155 SDtfs, 246 SDslu, 186 SDs, 0 SdLazy, 832 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf96 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf92 smp94 dnf100 smp100 tf110 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 36.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...