./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 2e94e6aa 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-2e94e6a [2019-01-01 21:32:02,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:32:02,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:32:02,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:32:02,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:32:02,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:32:02,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:32:02,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:32:02,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:32:02,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:32:02,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:32:02,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:32:02,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:32:02,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:32:02,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:32:02,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:32:02,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:32:02,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:32:02,122 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:32:02,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:32:02,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:32:02,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:32:02,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:32:02,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:32:02,129 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:32:02,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:32:02,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:32:02,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:32:02,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:32:02,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:32:02,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:32:02,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:32:02,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:32:02,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:32:02,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:32:02,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:32:02,139 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:32:02,156 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:32:02,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:32:02,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:32:02,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:32:02,158 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:32:02,158 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:32:02,158 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:32:02,158 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:32:02,158 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:32:02,159 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:32:02,159 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:32:02,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:32:02,159 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:32:02,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:32:02,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:32:02,161 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:32:02,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:32:02,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:32:02,161 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:32:02,162 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:32:02,162 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:32:02,162 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:32:02,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:32:02,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:32:02,163 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:32:02,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:32:02,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:32:02,164 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:32:02,165 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:32:02,165 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 [2019-01-01 21:32:02,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:32:02,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:32:02,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:32:02,224 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:32:02,225 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:32:02,226 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 [2019-01-01 21:32:02,284 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7860608/dade121961804c979634ba3adbcb587f/FLAG648af4c1d [2019-01-01 21:32:02,782 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:32:02,782 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:02,788 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7860608/dade121961804c979634ba3adbcb587f/FLAG648af4c1d [2019-01-01 21:32:03,150 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7860608/dade121961804c979634ba3adbcb587f [2019-01-01 21:32:03,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:32:03,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:32:03,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:03,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:32:03,161 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:32:03,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814bf51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03, skipping insertion in model container [2019-01-01 21:32:03,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:32:03,196 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:32:03,410 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:03,417 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:32:03,441 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:03,458 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:32:03,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03 WrapperNode [2019-01-01 21:32:03,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:03,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:03,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:32:03,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:32:03,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:03,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:32:03,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:32:03,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:32:03,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (1/1) ... [2019-01-01 21:32:03,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:32:03,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:32:03,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:32:03,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:32:03,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (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 [2019-01-01 21:32:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:32:03,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:32:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2019-01-01 21:32:03,671 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2019-01-01 21:32:03,834 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:32:03,835 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:32:03,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:03 BoogieIcfgContainer [2019-01-01 21:32:03,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:32:03,837 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:32:03,838 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:32:03,841 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:32:03,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:03,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:32:03" (1/3) ... [2019-01-01 21:32:03,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1923edd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:03, skipping insertion in model container [2019-01-01 21:32:03,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:03,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:03" (2/3) ... [2019-01-01 21:32:03,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1923edd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:03, skipping insertion in model container [2019-01-01 21:32:03,845 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:03,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:03" (3/3) ... [2019-01-01 21:32:03,848 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:03,928 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:32:03,929 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:32:03,929 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:32:03,929 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:32:03,930 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:32:03,930 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:32:03,930 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:32:03,930 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:32:03,932 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:32:03,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:32:03,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:03,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:03,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:03,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:03,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:03,993 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:32:03,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:32:03,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:03,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:03,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:03,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:03,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:04,007 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 [2019-01-01 21:32:04,008 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 [2019-01-01 21:32:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:04,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2019-01-01 21:32:04,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:04,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:04,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 36877, now seen corresponding path program 1 times [2019-01-01 21:32:04,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash 30036414, now seen corresponding path program 1 times [2019-01-01 21:32:04,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:04,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:04,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:04,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:04,358 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:32:04,472 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:04,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:04,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:04,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:04,474 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:04,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:04,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:04,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:04,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:04,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:04,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:04,641 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 [2019-01-01 21:32:04,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:04,647 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 [2019-01-01 21:32:04,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:04,680 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:04,732 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:04,736 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:04,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:04,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:04,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:04,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:04,737 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:04,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:04,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:04,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-01 21:32:04,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:04,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:04,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:04,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:04,995 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:04,997 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 [2019-01-01 21:32:04,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:04,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:05,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:05,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:05,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:05,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:05,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:05,015 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:05,023 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:05,024 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:05,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:05,026 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:05,027 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:05,028 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2019-01-01 21:32:05,030 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:05,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:05,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:05,303 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 [2019-01-01 21:32:05,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-01 21:32:05,599 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. [2019-01-01 21:32:05,600 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 [2019-01-01 21:32:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-01 21:32:05,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:32:05,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:05,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:32:05,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:05,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:32:05,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:05,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-01-01 21:32:05,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:05,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 18 states and 24 transitions. [2019-01-01 21:32:05,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:32:05,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:32:05,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-01-01 21:32:05,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:05,622 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:32:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-01-01 21:32:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-01 21:32:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:32:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-01 21:32:05,659 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:32:05,659 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:32:05,660 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:32:05,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-01 21:32:05,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:32:05,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:05,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:05,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:05,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:05,663 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 [2019-01-01 21:32:05,664 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 [2019-01-01 21:32:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1934452539, now seen corresponding path program 1 times [2019-01-01 21:32:05,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:05,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 1 times [2019-01-01 21:32:05,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:05,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:05,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash 418213862, now seen corresponding path program 1 times [2019-01-01 21:32:05,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:05,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:05,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:05,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:06,156 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:32:06,169 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:06,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:06,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:06,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:06,171 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:06,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:06,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:06,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:06,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:06,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:06,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:06,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:06,345 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:32:06,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:06,402 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 [2019-01-01 21:32:06,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:06,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:06,410 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:06,411 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 [2019-01-01 21:32:06,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:06,444 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:06,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:06,447 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) [2019-01-01 21:32:06,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:06,488 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) [2019-01-01 21:32:06,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:06,570 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 [2019-01-01 21:32:18,620 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:32:18,623 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:18,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:18,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:18,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:18,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:18,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:18,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:18,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:18,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:18,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:18,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:18,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:18,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:18,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:18,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:18,798 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:18,798 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 [2019-01-01 21:32:18,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:18,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:18,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:18,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:18,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:18,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:18,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:18,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:18,803 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 [2019-01-01 21:32:18,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:18,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:18,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:18,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:18,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:18,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:18,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:18,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:18,809 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 [2019-01-01 21:32:18,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:18,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:18,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:18,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:18,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:18,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:18,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:18,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:18,837 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:18,837 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:18,838 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:18,838 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:18,838 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:18,838 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2019-01-01 21:32:18,838 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:18,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:19,194 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 21:32:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:19,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:19,404 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 [2019-01-01 21:32:19,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2019-01-01 21:32:19,796 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-01-01 21:32:20,218 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. [2019-01-01 21:32:20,219 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 [2019-01-01 21:32:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-01 21:32:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2019-01-01 21:32:20,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:20,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2019-01-01 21:32:20,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:20,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2019-01-01 21:32:20,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:20,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2019-01-01 21:32:20,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:32:20,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 61 transitions. [2019-01-01 21:32:20,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:32:20,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 21:32:20,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2019-01-01 21:32:20,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:20,237 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2019-01-01 21:32:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2019-01-01 21:32:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-01-01 21:32:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 21:32:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-01-01 21:32:20,246 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-01 21:32:20,246 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-01 21:32:20,246 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:32:20,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-01-01 21:32:20,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:32:20,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:20,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:20,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:20,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:20,250 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 [2019-01-01 21:32:20,250 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 [2019-01-01 21:32:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash 595607827, now seen corresponding path program 2 times [2019-01-01 21:32:20,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:20,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:20,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:20,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 47317, now seen corresponding path program 2 times [2019-01-01 21:32:20,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:20,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891907, now seen corresponding path program 3 times [2019-01-01 21:32:20,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:20,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:20,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:20,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:20,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:32:20,477 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:20,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:20,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:20,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:20,478 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:20,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:20,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:20,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:20,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:20,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:20,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:20,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:20,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:20,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:20,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:20,535 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:20,536 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 [2019-01-01 21:32:20,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:20,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:20,558 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:20,559 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 [2019-01-01 21:32:20,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:20,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:20,589 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:20,590 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 [2019-01-01 21:32:20,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:20,611 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 [2019-01-01 21:32:20,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:20,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:32,674 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:32:32,677 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:32,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:32,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:32,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:32,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:32,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:32,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:32,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:32,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:32,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:32,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:32,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:32,737 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:32,738 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 [2019-01-01 21:32:32,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:32,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:32,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:32,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:32,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:32,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:32,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:32,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:32,743 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 [2019-01-01 21:32:32,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:32,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:32,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:32,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:32,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:32,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:32,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:32,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:32,750 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 [2019-01-01 21:32:32,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:32,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:32,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:32,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:32,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:32,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:32,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:32,769 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:32,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:32,777 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:32,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:32,778 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:32,778 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:32,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2019-01-01 21:32:32,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:32,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:32,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:32,945 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 [2019-01-01 21:32:32,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-01 21:32:33,072 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. [2019-01-01 21:32:33,074 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 [2019-01-01 21:32:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-01 21:32:33,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 21:32:33,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,075 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:33,216 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 [2019-01-01 21:32:33,216 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-01 21:32:33,340 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. [2019-01-01 21:32:33,344 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 [2019-01-01 21:32:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-01 21:32:33,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 21:32:33,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,345 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:33,457 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 [2019-01-01 21:32:33,457 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-01-01 21:32:33,569 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. [2019-01-01 21:32:33,570 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 [2019-01-01 21:32:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-01 21:32:33,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 21:32:33,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:32:33,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-01 21:32:33,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 99 transitions. [2019-01-01 21:32:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 21:32:33,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 73 transitions. [2019-01-01 21:32:33,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 21:32:33,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:32:33,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2019-01-01 21:32:33,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:33,581 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-01-01 21:32:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2019-01-01 21:32:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-01-01 21:32:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 21:32:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2019-01-01 21:32:33,588 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2019-01-01 21:32:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:32:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:32:33,592 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 8 states. [2019-01-01 21:32:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:33,733 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-01-01 21:32:33,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:32:33,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2019-01-01 21:32:33,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:32:33,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 74 transitions. [2019-01-01 21:32:33,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 21:32:33,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-01 21:32:33,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2019-01-01 21:32:33,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:33,740 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2019-01-01 21:32:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2019-01-01 21:32:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-01 21:32:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 21:32:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-01-01 21:32:33,749 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-01-01 21:32:33,749 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-01-01 21:32:33,749 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:32:33,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2019-01-01 21:32:33,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:32:33,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:33,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:33,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:32:33,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2019-01-01 21:32:33,753 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~ret0;havoc #t~ret1; 848#mc91FINAL assume true; 847#mc91EXIT >#19#return; 809#L11-1 call #t~ret1 := mc91(#t~ret0);< 846#mc91ENTRY [2019-01-01 21:32:33,753 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~ret0;havoc #t~ret1; 848#mc91FINAL assume true; 847#mc91EXIT >#19#return; 810#L11-1 call #t~ret1 := mc91(#t~ret0);< 846#mc91ENTRY [2019-01-01 21:32:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -104606680, now seen corresponding path program 1 times [2019-01-01 21:32:33,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash -735472521, now seen corresponding path program 1 times [2019-01-01 21:32:33,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:33,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,785 INFO L82 PathProgramCache]: Analyzing trace with hash -726341392, now seen corresponding path program 2 times [2019-01-01 21:32:33,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:33,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-01 21:32:33,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:33,914 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 [2019-01-01 21:32:33,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:32:33,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:32:33,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:33,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-01 21:32:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:34,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 21:32:34,480 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:34,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:34,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:34,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:34,481 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:34,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:34,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:34,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:34,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:32:34,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:34,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:34,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:34,542 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 [2019-01-01 21:32:34,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:34,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:34,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:34,550 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 [2019-01-01 21:32:34,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:34,571 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:34,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:34,574 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 [2019-01-01 21:32:34,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:34,596 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:34,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:34,598 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 [2019-01-01 21:32:34,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:34,621 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 [2019-01-01 21:32:34,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:34,647 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:34,682 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:34,684 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:34,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:34,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:34,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:34,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:34,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:34,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:34,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:34,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:32:34,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:34,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:34,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,773 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:34,773 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:34,774 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 [2019-01-01 21:32:34,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:34,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:34,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:34,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:34,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:34,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:34,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:34,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:34,777 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 [2019-01-01 21:32:34,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:34,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:34,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:34,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:34,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:34,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:34,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:34,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:34,780 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 [2019-01-01 21:32:34,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:34,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:34,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:34,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:34,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:34,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:34,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:34,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:34,783 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 [2019-01-01 21:32:34,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:34,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:34,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:34,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:34,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:34,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:34,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:34,788 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:34,790 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:34,790 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:34,790 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:34,790 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:34,791 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:34,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2019-01-01 21:32:34,791 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 21:32:35,177 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 [2019-01-01 21:32:35,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-01-01 21:32:35,706 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. [2019-01-01 21:32:35,708 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 [2019-01-01 21:32:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:32:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-01-01 21:32:35,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-01 21:32:35,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:35,709 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:35,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:35,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 21:32:36,455 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 [2019-01-01 21:32:36,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-01-01 21:32:37,027 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. [2019-01-01 21:32:37,029 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 [2019-01-01 21:32:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:32:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-01-01 21:32:37,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-01 21:32:37,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:37,031 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 21:32:37,949 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 [2019-01-01 21:32:37,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2019-01-01 21:32:39,009 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. [2019-01-01 21:32:39,011 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 [2019-01-01 21:32:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:32:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2019-01-01 21:32:39,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 19 letters. [2019-01-01 21:32:39,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:39,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 40 letters. Loop has 19 letters. [2019-01-01 21:32:39,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:39,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 38 letters. [2019-01-01 21:32:39,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:39,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 530 transitions. [2019-01-01 21:32:39,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2019-01-01 21:32:39,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 202 states and 268 transitions. [2019-01-01 21:32:39,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-01-01 21:32:39,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2019-01-01 21:32:39,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 268 transitions. [2019-01-01 21:32:39,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:39,039 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 268 transitions. [2019-01-01 21:32:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 268 transitions. [2019-01-01 21:32:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2019-01-01 21:32:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-01 21:32:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2019-01-01 21:32:39,064 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 197 transitions. [2019-01-01 21:32:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:32:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:32:39,065 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand 9 states. [2019-01-01 21:32:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:39,357 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2019-01-01 21:32:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:32:39,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 187 transitions. [2019-01-01 21:32:39,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:32:39,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 103 states and 122 transitions. [2019-01-01 21:32:39,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2019-01-01 21:32:39,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-01 21:32:39,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2019-01-01 21:32:39,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:39,367 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-01-01 21:32:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2019-01-01 21:32:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-01-01 21:32:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 21:32:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-01-01 21:32:39,378 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-01-01 21:32:39,379 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-01-01 21:32:39,379 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:32:39,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2019-01-01 21:32:39,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:32:39,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:39,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:39,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2019-01-01 21:32:39,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:39,384 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~ret0;havoc #t~ret1; 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 [2019-01-01 21:32:39,385 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 [2019-01-01 21:32:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1788916079, now seen corresponding path program 3 times [2019-01-01 21:32:39,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:39,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-01 21:32:39,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:39,632 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 [2019-01-01 21:32:39,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:32:39,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-01 21:32:39,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:39,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 21:32:39,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:32:39,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2019-01-01 21:32:39,691 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:32:39,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 938335010, now seen corresponding path program 2 times [2019-01-01 21:32:39,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:39,813 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:39,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:39,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:39,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:39,813 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:39,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:39,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:39,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:39,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-01 21:32:39,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:39,814 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:39,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:39,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:39,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:39,903 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:39,904 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 [2019-01-01 21:32:39,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:39,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:39,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:39,914 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 [2019-01-01 21:32:39,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:39,935 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 [2019-01-01 21:32:39,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:39,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:52,809 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 21:32:52,813 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:52,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:52,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:52,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:52,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:52,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:52,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:52,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:52,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-01 21:32:52,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:52,814 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:52,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:52,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:52,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:52,899 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:52,899 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 [2019-01-01 21:32:52,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:52,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:52,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:52,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:52,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:52,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:52,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:52,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:52,902 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 [2019-01-01 21:32:52,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:52,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:52,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:52,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:52,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:52,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:52,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:52,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:52,911 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:52,912 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:52,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:52,912 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:52,912 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:52,912 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2019-01-01 21:32:52,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:53,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:53,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:53,204 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 [2019-01-01 21:32:53,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-01-01 21:32:53,519 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. [2019-01-01 21:32:53,521 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 [2019-01-01 21:32:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-01 21:32:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-01 21:32:53,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:53,522 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:53,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:53,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:53,785 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 [2019-01-01 21:32:53,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-01-01 21:32:54,039 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. [2019-01-01 21:32:54,042 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 [2019-01-01 21:32:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-01 21:32:54,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-01 21:32:54,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:54,043 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:54,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:54,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:54,251 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 [2019-01-01 21:32:54,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2019-01-01 21:32:54,576 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. [2019-01-01 21:32:54,581 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 [2019-01-01 21:32:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2019-01-01 21:32:54,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 8 letters. [2019-01-01 21:32:54,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:54,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 39 letters. Loop has 8 letters. [2019-01-01 21:32:54,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:54,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 16 letters. [2019-01-01 21:32:54,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:54,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 210 transitions. [2019-01-01 21:32:54,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:54,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2019-01-01 21:32:54,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:54,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:54,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:54,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:54,588 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:54,588 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:32:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:32:54,589 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2019-01-01 21:32:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:54,589 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:32:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:32:54,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:32:54,589 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:54,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:32:54,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:54,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:54,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:54,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:54,590 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:54,590 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:54,590 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:54,590 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:32:54,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:32:54,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:54,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:32:54,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:32:54 BoogieIcfgContainer [2019-01-01 21:32:54,598 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:32:54,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:32:54,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:32:54,600 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:32:54,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:03" (3/4) ... [2019-01-01 21:32:54,609 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:32:54,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:32:54,610 INFO L168 Benchmark]: Toolchain (without parser) took 51455.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -343.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:54,611 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:54,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.08 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:54,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:54,613 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:54,613 INFO L168 Benchmark]: RCFGBuilder took 305.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:54,615 INFO L168 Benchmark]: BuchiAutomizer took 50760.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:54,616 INFO L168 Benchmark]: Witness Printer took 9.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:54,621 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.08 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 44.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 305.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50760.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. 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 50.6s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 41.3s. Construction of modules took 1.4s. Büchi inclusion checks took 7.5s. 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.4s 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: 31ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 37.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...