./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 37028c56b7915050ee6a79b5e737b9e44bf7c3db ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:02:09,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:02:09,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:02:09,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:02:09,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:02:09,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:02:09,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:02:09,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:02:09,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:02:09,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:02:09,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:02:09,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:02:09,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:02:09,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:02:09,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:02:09,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:02:09,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:02:09,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:02:09,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:02:09,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:02:09,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:02:09,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:02:09,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:02:09,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:02:09,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:02:09,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:02:09,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:02:09,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:02:09,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:02:09,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:02:09,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:02:09,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:02:09,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:02:09,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:02:09,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:02:09,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:02:09,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:02:09,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:02:09,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:02:09,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:02:09,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:02:09,663 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:02:09,663 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:02:09,663 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:02:09,663 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:02:09,663 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:02:09,664 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:02:09,664 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:02:09,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:02:09,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:02:09,664 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:02:09,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:02:09,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:02:09,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:02:09,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:02:09,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:02:09,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:02:09,668 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:02:09,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:02:09,668 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:02:09,668 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:02:09,668 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:02:09,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:02:09,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:02:09,669 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:02:09,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:02:09,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:02:09,670 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:02:09,670 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:02:09,674 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37028c56b7915050ee6a79b5e737b9e44bf7c3db [2018-11-29 00:02:09,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:02:09,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:02:09,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:02:09,742 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:02:09,742 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:02:09,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c [2018-11-29 00:02:09,799 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf381986/8e580e69cdfe4134894bf36c2b85d2b9/FLAGb24e57be5 [2018-11-29 00:02:10,217 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:02:10,218 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c [2018-11-29 00:02:10,224 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf381986/8e580e69cdfe4134894bf36c2b85d2b9/FLAGb24e57be5 [2018-11-29 00:02:10,592 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf381986/8e580e69cdfe4134894bf36c2b85d2b9 [2018-11-29 00:02:10,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:02:10,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:02:10,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:10,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:02:10,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:02:10,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a828241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10, skipping insertion in model container [2018-11-29 00:02:10,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:02:10,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:02:10,863 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:10,868 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:02:10,890 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:02:10,908 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:02:10,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10 WrapperNode [2018-11-29 00:02:10,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:02:10,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:10,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:02:10,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:02:10,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:02:10,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:02:10,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:02:10,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:02:10,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... [2018-11-29 00:02:10,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:02:10,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:02:10,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:02:10,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:02:10,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:02:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:02:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2018-11-29 00:02:11,117 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2018-11-29 00:02:11,436 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:02:11,437 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:02:11,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:11 BoogieIcfgContainer [2018-11-29 00:02:11,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:02:11,439 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:02:11,439 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:02:11,445 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:02:11,446 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:11,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:02:10" (1/3) ... [2018-11-29 00:02:11,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6640efbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:11, skipping insertion in model container [2018-11-29 00:02:11,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:11,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:10" (2/3) ... [2018-11-29 00:02:11,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6640efbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:02:11, skipping insertion in model container [2018-11-29 00:02:11,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:02:11,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:11" (3/3) ... [2018-11-29 00:02:11,450 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_false-unreach-call_true-no-overflow_true-termination.c [2018-11-29 00:02:11,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:02:11,612 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:02:11,615 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:02:11,615 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:02:11,615 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:02:11,615 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:02:11,615 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:02:11,616 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:02:11,616 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:02:11,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:02:11,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:11,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:11,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:11,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:11,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:11,711 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:02:11,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-29 00:02:11,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:11,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:11,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:11,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:02:11,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:11,726 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L26true call main_#t~ret3 := f91(main_~x~0);< 16#f91ENTRYtrue [2018-11-29 00:02:11,727 INFO L796 eck$LassoCheckResult]: Loop: 16#f91ENTRYtrue ~x := #in~x; 10#L16true assume !(~x > 100); 7#L19true call #t~ret0 := f91(11 + ~x);< 16#f91ENTRYtrue [2018-11-29 00:02:11,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1015, now seen corresponding path program 1 times [2018-11-29 00:02:11,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:11,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:11,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:11,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash 43828, now seen corresponding path program 1 times [2018-11-29 00:02:11,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:11,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:11,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:11,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 30251902, now seen corresponding path program 1 times [2018-11-29 00:02:11,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:11,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:11,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:12,078 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:12,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:12,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:12,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:12,080 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:12,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:12,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:12,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-29 00:02:12,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:12,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:12,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:12,267 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:12,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:12,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:12,305 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:12,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:12,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:12,334 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:12,355 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:12,386 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:12,420 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:12,422 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:12,422 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:12,422 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:12,422 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:12,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:12,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:12,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:12,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:12,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2018-11-29 00:02:12,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:12,423 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:12,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:12,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:12,808 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:12,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 [2018-11-29 00:02:12,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:12,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:12,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:12,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:12,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:12,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:12,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:12,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:12,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:12,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:12,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:12,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:12,842 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:12,842 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:12,844 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:12,844 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:12,845 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:12,845 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2018-11-29 00:02:12,847 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:12,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:12,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:12,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:13,143 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:02:13,144 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2018-11-29 00:02:13,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 33 states and 41 transitions. Complement of second has 12 states. [2018-11-29 00:02:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:02:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-29 00:02:13,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-29 00:02:13,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:13,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-29 00:02:13,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:13,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-29 00:02:13,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:13,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2018-11-29 00:02:13,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:13,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 18 states and 24 transitions. [2018-11-29 00:02:13,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:02:13,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:02:13,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-29 00:02:13,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:13,440 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-29 00:02:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-29 00:02:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-29 00:02:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-29 00:02:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-29 00:02:13,476 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-29 00:02:13,476 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-29 00:02:13,476 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:02:13,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-29 00:02:13,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:02:13,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:13,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:13,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:13,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:13,481 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 99#L26 call main_#t~ret3 := f91(main_~x~0);< 104#f91ENTRY ~x := #in~x; 109#L16 assume !(~x > 100); 100#L19 call #t~ret0 := f91(11 + ~x);< 107#f91ENTRY ~x := #in~x; 110#L16 assume ~x > 100;#res := ~x - 10; 112#f91FINAL assume true; 111#f91EXIT >#26#return; 101#L19-1 [2018-11-29 00:02:13,481 INFO L796 eck$LassoCheckResult]: Loop: 101#L19-1 call #t~ret1 := f91(#t~ret0);< 106#f91ENTRY ~x := #in~x; 113#L16 assume !(~x > 100); 102#L19 call #t~ret0 := f91(11 + ~x);< 106#f91ENTRY ~x := #in~x; 113#L16 assume ~x > 100;#res := ~x - 10; 103#f91FINAL assume true; 108#f91EXIT >#26#return; 101#L19-1 [2018-11-29 00:02:13,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash -495039419, now seen corresponding path program 1 times [2018-11-29 00:02:13,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1917219166, now seen corresponding path program 1 times [2018-11-29 00:02:13,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:13,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:13,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:13,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:13,512 INFO L82 PathProgramCache]: Analyzing trace with hash -984000794, now seen corresponding path program 1 times [2018-11-29 00:02:13,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:13,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:13,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:13,760 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-29 00:02:13,989 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-29 00:02:14,144 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-29 00:02:14,157 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:14,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:14,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:14,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:14,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:14,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:14,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:14,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:14,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2018-11-29 00:02:14,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:14,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:14,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:14,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:14,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:14,364 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:14,364 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:14,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:14,374 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:14,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:14,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:26,459 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-29 00:02:26,463 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:26,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:26,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:26,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:26,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:26,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:26,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:26,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:26,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2018-11-29 00:02:26,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:26,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:26,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:26,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:26,596 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:26,596 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:26,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:26,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:26,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:26,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:26,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:26,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:26,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:26,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:26,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:26,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:26,621 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:26,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:26,622 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:26,622 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:26,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret0) = -2*f91_#t~ret0 + 201 Supporting invariants [] [2018-11-29 00:02:26,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:26,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:26,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:26,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:26,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:02:26,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-29 00:02:27,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 50 states and 72 transitions. Complement of second has 32 states. [2018-11-29 00:02:27,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:02:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:02:27,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-29 00:02:27,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:27,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-29 00:02:27,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:27,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-29 00:02:27,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:27,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2018-11-29 00:02:27,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:02:27,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 61 transitions. [2018-11-29 00:02:27,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-29 00:02:27,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-29 00:02:27,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 61 transitions. [2018-11-29 00:02:27,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:27,433 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 61 transitions. [2018-11-29 00:02:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 61 transitions. [2018-11-29 00:02:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-11-29 00:02:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-29 00:02:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-11-29 00:02:27,443 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-29 00:02:27,444 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-29 00:02:27,444 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:02:27,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-11-29 00:02:27,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-29 00:02:27,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:27,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:27,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:27,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:02:27,448 INFO L794 eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 289#L26 call main_#t~ret3 := f91(main_~x~0);< 290#f91ENTRY ~x := #in~x; 312#L16 assume !(~x > 100); 281#L19 call #t~ret0 := f91(11 + ~x);< 297#f91ENTRY ~x := #in~x; 303#L16 assume ~x > 100;#res := ~x - 10; 310#f91FINAL assume true; 309#f91EXIT >#26#return; 285#L19-1 call #t~ret1 := f91(#t~ret0);< 294#f91ENTRY ~x := #in~x; 313#L16 assume !(~x > 100); 295#L19 [2018-11-29 00:02:27,449 INFO L796 eck$LassoCheckResult]: Loop: 295#L19 call #t~ret0 := f91(11 + ~x);< 296#f91ENTRY ~x := #in~x; 304#L16 assume !(~x > 100); 295#L19 [2018-11-29 00:02:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1198389434, now seen corresponding path program 2 times [2018-11-29 00:02:27,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:27,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:27,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:27,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash 54268, now seen corresponding path program 2 times [2018-11-29 00:02:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:27,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:27,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1451488419, now seen corresponding path program 3 times [2018-11-29 00:02:27,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:27,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-29 00:02:27,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:02:27,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-29 00:02:27,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:27,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:27,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:27,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:27,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:27,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:27,654 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:27,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:27,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-29 00:02:27,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:27,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:27,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:27,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:27,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:27,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:27,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:27,719 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) [2018-11-29 00:02:27,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:27,731 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:27,746 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:27,746 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:27,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:27,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:27,775 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:27,775 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:27,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:27,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:27,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:27,800 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:27,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:27,825 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:27,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:27,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:39,893 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-29 00:02:39,896 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:39,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:39,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:39,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:39,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:39,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:39,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:39,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:39,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2018-11-29 00:02:39,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:39,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:39,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:39,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:39,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:39,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:39,966 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:39,967 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:39,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:39,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:39,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:39,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:39,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:39,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:39,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:39,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:39,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:39,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:39,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:39,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:39,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:39,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:39,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:39,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:39,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:39,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:39,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:39,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:39,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:39,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:39,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:39,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:39,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:39,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:39,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:39,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:39,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:39,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:39,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:39,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:39,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:39,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:39,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:39,988 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:39,996 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:39,997 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:39,997 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:39,997 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:39,997 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:39,997 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_~x) = -2*f91_~x + 189 Supporting invariants [] [2018-11-29 00:02:40,000 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:40,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:40,173 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:40,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-29 00:02:40,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2018-11-29 00:02:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-29 00:02:40,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:02:40,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,321 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:40,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:40,454 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:40,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-29 00:02:40,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 42 states and 58 transitions. Complement of second has 13 states. [2018-11-29 00:02:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-29 00:02:40,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:02:40,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,549 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:40,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:40,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:40,740 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:02:40,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19 Second operand 5 states. [2018-11-29 00:02:40,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 70 states and 99 transitions. Complement of second has 16 states. [2018-11-29 00:02:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:02:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-29 00:02:40,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-29 00:02:40,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:02:40,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-29 00:02:40,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:40,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 99 transitions. [2018-11-29 00:02:40,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-29 00:02:40,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 73 transitions. [2018-11-29 00:02:40,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-29 00:02:40,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-29 00:02:40,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2018-11-29 00:02:40,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:40,911 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-11-29 00:02:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2018-11-29 00:02:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-29 00:02:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-29 00:02:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2018-11-29 00:02:40,919 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2018-11-29 00:02:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:02:40,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:02:40,924 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 8 states. [2018-11-29 00:02:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:41,066 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-29 00:02:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-29 00:02:41,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2018-11-29 00:02:41,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-29 00:02:41,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 74 transitions. [2018-11-29 00:02:41,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-29 00:02:41,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-29 00:02:41,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 74 transitions. [2018-11-29 00:02:41,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:41,079 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-11-29 00:02:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 74 transitions. [2018-11-29 00:02:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-29 00:02:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-29 00:02:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-11-29 00:02:41,087 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-11-29 00:02:41,088 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-11-29 00:02:41,089 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:02:41,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2018-11-29 00:02:41,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-29 00:02:41,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:41,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:41,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-29 00:02:41,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2018-11-29 00:02:41,095 INFO L794 eck$LassoCheckResult]: Stem: 814#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 812#L26 call main_#t~ret3 := f91(main_~x~0);< 813#f91ENTRY ~x := #in~x; 834#L16 assume !(~x > 100); 835#L19 call #t~ret0 := f91(11 + ~x);< 841#f91ENTRY ~x := #in~x; 844#L16 assume !(~x > 100); 839#L19 call #t~ret0 := f91(11 + ~x);< 842#f91ENTRY ~x := #in~x; 845#L16 assume ~x > 100;#res := ~x - 10; 843#f91FINAL assume true; 840#f91EXIT >#26#return; 810#L19-1 call #t~ret1 := f91(#t~ret0);< 817#f91ENTRY ~x := #in~x; 859#L16 assume ~x > 100;#res := ~x - 10; 858#f91FINAL assume true; 855#f91EXIT >#28#return; 853#L19-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 854#f91FINAL assume true; 852#f91EXIT >#26#return; 848#L19-1 call #t~ret1 := f91(#t~ret0);< 851#f91ENTRY [2018-11-29 00:02:41,095 INFO L796 eck$LassoCheckResult]: Loop: 851#f91ENTRY ~x := #in~x; 846#L16 assume !(~x > 100); 821#L19 call #t~ret0 := f91(11 + ~x);< 822#f91ENTRY ~x := #in~x; 830#L16 assume !(~x > 100); 820#L19 call #t~ret0 := f91(11 + ~x);< 823#f91ENTRY ~x := #in~x; 829#L16 assume ~x > 100;#res := ~x - 10; 861#f91FINAL assume true; 831#f91EXIT >#26#return; 807#L19-1 call #t~ret1 := f91(#t~ret0);< 815#f91ENTRY ~x := #in~x; 850#L16 assume ~x > 100;#res := ~x - 10; 824#f91FINAL assume true; 825#f91EXIT >#28#return; 853#L19-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 854#f91FINAL assume true; 852#f91EXIT >#26#return; 847#L19-1 call #t~ret1 := f91(#t~ret0);< 851#f91ENTRY [2018-11-29 00:02:41,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash 803701992, now seen corresponding path program 1 times [2018-11-29 00:02:41,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1260361570, now seen corresponding path program 1 times [2018-11-29 00:02:41,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:41,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:41,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 187356247, now seen corresponding path program 2 times [2018-11-29 00:02:41,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:41,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:41,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:02:41,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-29 00:02:41,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:41,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:41,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:02:41,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:02:41,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:41,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-29 00:02:41,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:02:41,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:02:41,809 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:41,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:41,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:41,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:41,810 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:41,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:41,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:41,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:41,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-29 00:02:41,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:41,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:41,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:41,952 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:41,953 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:41,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:41,957 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:41,959 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:41,959 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:41,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:41,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:41,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:41,984 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_~x=0} Honda state: {f91_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:42,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:42,008 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:42,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:42,031 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret0=0} Honda state: {f91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:42,053 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:42,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:42,473 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:02:42,476 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:42,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:42,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:42,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:42,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:42,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:42,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:42,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:42,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2018-11-29 00:02:42,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:42,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:42,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:42,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:42,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:42,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:42,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:42,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:42,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:42,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:42,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:42,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:42,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:42,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:42,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:42,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:42,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:42,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:42,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:42,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:42,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:42,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:42,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:42,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:42,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:42,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:42,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:42,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:42,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:42,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:42,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:42,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:42,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:42,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:42,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:42,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:42,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:42,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:42,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:42,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:42,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:02:42,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:42,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:42,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:42,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:42,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:42,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:42,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:42,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:42,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:42,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:42,563 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:42,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:42,564 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:42,564 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:42,564 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2018-11-29 00:02:42,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:42,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:42,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:42,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:02:43,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-29 00:02:43,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-29 00:02:43,693 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2018-11-29 00:02:43,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:02:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-29 00:02:43,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-29 00:02:43,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:43,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:43,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:43,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:43,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:02:44,000 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-29 00:02:44,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-29 00:02:44,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 124 states and 149 transitions. Complement of second has 47 states. [2018-11-29 00:02:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:02:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2018-11-29 00:02:44,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 33 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-29 00:02:44,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:44,813 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:02:44,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:44,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-29 00:02:45,158 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-29 00:02:45,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21 Second operand 12 states. [2018-11-29 00:02:46,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 73 transitions. cyclomatic complexity: 21. Second operand 12 states. Result 430 states and 530 transitions. Complement of second has 216 states. [2018-11-29 00:02:46,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-29 00:02:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-29 00:02:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 48 transitions. [2018-11-29 00:02:46,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 19 letters. [2018-11-29 00:02:46,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:46,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 40 letters. Loop has 19 letters. [2018-11-29 00:02:46,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:46,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 48 transitions. Stem has 21 letters. Loop has 38 letters. [2018-11-29 00:02:46,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:02:46,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 530 transitions. [2018-11-29 00:02:46,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-29 00:02:46,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 202 states and 268 transitions. [2018-11-29 00:02:46,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2018-11-29 00:02:46,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-29 00:02:46,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 268 transitions. [2018-11-29 00:02:46,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:46,232 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 268 transitions. [2018-11-29 00:02:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 268 transitions. [2018-11-29 00:02:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2018-11-29 00:02:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-29 00:02:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2018-11-29 00:02:46,255 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 197 transitions. [2018-11-29 00:02:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:02:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:02:46,255 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand 9 states. [2018-11-29 00:02:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:02:46,556 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2018-11-29 00:02:46,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-29 00:02:46,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 187 transitions. [2018-11-29 00:02:46,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-29 00:02:46,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 103 states and 122 transitions. [2018-11-29 00:02:46,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-29 00:02:46,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-29 00:02:46,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 122 transitions. [2018-11-29 00:02:46,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:02:46,585 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-29 00:02:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 122 transitions. [2018-11-29 00:02:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-29 00:02:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-29 00:02:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-11-29 00:02:46,604 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-29 00:02:46,604 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-29 00:02:46,604 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:02:46,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2018-11-29 00:02:46,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-29 00:02:46,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:02:46,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:02:46,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2018-11-29 00:02:46,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:02:46,614 INFO L794 eck$LassoCheckResult]: Stem: 2797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~x~0, main_~result~0;main_~x~0 := main_#t~nondet2;havoc main_#t~nondet2; 2789#L26 call main_#t~ret3 := f91(main_~x~0);< 2790#f91ENTRY ~x := #in~x; 2818#L16 assume !(~x > 100); 2814#L19 call #t~ret0 := f91(11 + ~x);< 2813#f91ENTRY ~x := #in~x; 2816#L16 assume !(~x > 100); 2815#L19 call #t~ret0 := f91(11 + ~x);< 2847#f91ENTRY ~x := #in~x; 2850#L16 assume ~x > 100;#res := ~x - 10; 2849#f91FINAL assume true; 2848#f91EXIT >#26#return; 2843#L19-1 call #t~ret1 := f91(#t~ret0);< 2845#f91ENTRY ~x := #in~x; 2865#L16 assume ~x > 100;#res := ~x - 10; 2851#f91FINAL assume true; 2842#f91EXIT >#28#return; 2841#L19-2 #res := #t~ret1;havoc #t~ret0;havoc #t~ret1; 2839#f91FINAL assume true; 2838#f91EXIT >#26#return; 2832#L19-1 call #t~ret1 := f91(#t~ret0);< 2837#f91ENTRY ~x := #in~x; 2835#L16 assume !(~x > 100); 2799#L19 call #t~ret0 := f91(11 + ~x);< 2807#f91ENTRY ~x := #in~x; 2840#L16 assume !(~x > 100); 2800#L19 call #t~ret0 := f91(11 + ~x);< 2806#f91ENTRY ~x := #in~x; 2882#L16 assume ~x > 100;#res := ~x - 10; 2881#f91FINAL assume true; 2878#f91EXIT >#26#return; 2798#L19-1 [2018-11-29 00:02:46,614 INFO L796 eck$LassoCheckResult]: Loop: 2798#L19-1 call #t~ret1 := f91(#t~ret0);< 2801#f91ENTRY ~x := #in~x; 2830#L16 assume !(~x > 100); 2831#L19 call #t~ret0 := f91(11 + ~x);< 2879#f91ENTRY ~x := #in~x; 2886#L16 assume ~x > 100;#res := ~x - 10; 2885#f91FINAL assume true; 2877#f91EXIT >#26#return; 2798#L19-1 [2018-11-29 00:02:46,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1994701169, now seen corresponding path program 3 times [2018-11-29 00:02:46,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:46,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:46,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:02:46,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:02:46,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:02:46,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:02:46,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-29 00:02:46,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:02:46,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-29 00:02:46,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-29 00:02:46,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2018-11-29 00:02:46,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:02:46,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1917219166, now seen corresponding path program 2 times [2018-11-29 00:02:46,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:02:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:02:46,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:46,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:02:46,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:02:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:02:46,987 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:46,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:46,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:46,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:46,988 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:02:46,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:46,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:46,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:46,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-29 00:02:46,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:46,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:46,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:46,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:47,043 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:47,043 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:47,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:47,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:47,053 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:47,053 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:47,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:47,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:47,079 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:02:47,079 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret1=0} Honda state: {f91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:47,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:02:47,104 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:47,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:02:47,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:02:59,341 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-29 00:02:59,344 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:02:59,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:02:59,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:02:59,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:02:59,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:02:59,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:02:59,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:02:59,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:02:59,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_false-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2018-11-29 00:02:59,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:02:59,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:02:59,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:59,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:59,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:02:59,405 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:02:59,405 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:02:59,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:02:59,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:02:59,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:02:59,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:02:59,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:02:59,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:02:59,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:02:59,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:02:59,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:02:59,429 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:02:59,430 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:02:59,432 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:02:59,432 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:02:59,432 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:02:59,432 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret0) = -2*f91_#t~ret0 + 201 Supporting invariants [] [2018-11-29 00:02:59,432 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:02:59,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:02:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:02:59,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:02:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:02:59,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:02:59,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-29 00:03:00,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2018-11-29 00:03:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:03:00,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-29 00:03:00,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:00,196 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:00,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:00,411 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:00,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-29 00:03:00,625 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 138 states and 160 transitions. Complement of second has 24 states. [2018-11-29 00:03:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-11-29 00:03:00,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 16 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-29 00:03:00,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:00,628 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:00,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:00,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:00,858 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-29 00:03:00,859 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-29 00:03:01,152 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 180 states and 210 transitions. Complement of second has 27 states. [2018-11-29 00:03:01,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:03:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-29 00:03:01,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-29 00:03:01,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 39 letters. Loop has 8 letters. [2018-11-29 00:03:01,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 31 letters. Loop has 16 letters. [2018-11-29 00:03:01,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:01,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 210 transitions. [2018-11-29 00:03:01,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:01,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 0 states and 0 transitions. [2018-11-29 00:03:01,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:01,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:01,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:01,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:01,169 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:01,169 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-29 00:03:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-29 00:03:01,170 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2018-11-29 00:03:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:01,173 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:03:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:03:01,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:03:01,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:01,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:03:01,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:01,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:01,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:01,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:01,174 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:01,175 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:01,175 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:01,175 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:01,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:01,175 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:01,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:01,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:01 BoogieIcfgContainer [2018-11-29 00:03:01,189 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:01,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:01,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:01,190 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:01,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:11" (3/4) ... [2018-11-29 00:03:01,196 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:01,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:01,197 INFO L168 Benchmark]: Toolchain (without parser) took 50600.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 950.0 MB in the beginning and 804.0 MB in the end (delta: 146.0 MB). Peak memory consumption was 416.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:01,200 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-11-29 00:03:01,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.29 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:01,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.50 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:01,202 INFO L168 Benchmark]: Boogie Preprocessor took 22.39 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:01,203 INFO L168 Benchmark]: RCFGBuilder took 459.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:01,204 INFO L168 Benchmark]: BuchiAutomizer took 49749.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 804.0 MB in the end (delta: 302.1 MB). Peak memory consumption was 451.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:01,205 INFO L168 Benchmark]: Witness Printer took 7.18 ms. Allocated memory is still 1.3 GB. Free memory is still 804.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:01,212 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.16 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 311.29 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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.50 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.39 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 459.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49749.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 804.0 MB in the end (delta: 302.1 MB). Peak memory consumption was 451.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.18 ms. Allocated memory is still 1.3 GB. Free memory is still 804.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * \old(x) + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * aux-f91(x+11)-aux + 201 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * x + 189 and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(x) + 90 and consists of 20 locations. One nondeterministic module has affine ranking function -2 * aux-f91(x+11)-aux + 201 and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 49.6s and 6 iterations. TraceHistogramMax:7. Analysis of lassos took 41.1s. Construction of modules took 1.3s. Büchi inclusion checks took 6.7s. 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, 273 SDslu, 162 SDs, 0 SdLazy, 735 SolverSat, 231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s 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 smp100 dnf100 smp100 tf109 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 37.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...