./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0837a1e1d82be1b28ccf3514392f1b01c88a9160 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:32:26,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:32:26,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:32:26,132 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:32:26,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:32:26,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:32:26,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:32:26,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:32:26,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:32:26,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:32:26,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:32:26,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:32:26,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:32:26,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:32:26,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:32:26,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:32:26,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:32:26,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:32:26,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:32:26,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:32:26,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:32:26,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:32:26,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:32:26,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:32:26,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:32:26,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:32:26,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:32:26,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:32:26,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:32:26,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:32:26,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:32:26,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:32:26,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:32:26,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:32:26,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:32:26,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:32:26,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:32:26,235 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:32:26,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:32:26,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:32:26,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:32:26,241 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:32:26,242 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:32:26,242 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:32:26,242 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:32:26,242 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:32:26,242 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:32:26,242 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:32:26,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:32:26,245 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:32:26,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:32:26,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:32:26,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:32:26,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:32:26,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:32:26,246 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:32:26,246 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:32:26,247 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:32:26,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:32:26,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:32:26,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:32:26,247 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:32:26,248 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:32:26,248 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:32:26,248 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:32:26,253 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:32:26,253 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-01-01 21:32:26,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:32:26,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:32:26,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:32:26,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:32:26,337 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:32:26,338 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:26,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8286f3743/1560cc063ab243a2a618228377964873/FLAGf4cc25385 [2019-01-01 21:32:26,857 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:32:26,858 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:26,864 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8286f3743/1560cc063ab243a2a618228377964873/FLAGf4cc25385 [2019-01-01 21:32:27,195 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8286f3743/1560cc063ab243a2a618228377964873 [2019-01-01 21:32:27,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:32:27,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:32:27,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:27,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:32:27,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:32:27,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3801b5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27, skipping insertion in model container [2019-01-01 21:32:27,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:32:27,235 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:32:27,413 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:27,417 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:32:27,432 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:32:27,448 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:32:27,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27 WrapperNode [2019-01-01 21:32:27,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:32:27,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:27,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:32:27,450 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:32:27,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:32:27,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:32:27,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:32:27,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:32:27,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... [2019-01-01 21:32:27,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:32:27,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:32:27,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:32:27,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:32:27,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:27,637 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-01-01 21:32:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-01-01 21:32:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-01-01 21:32:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-01-01 21:32:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:32:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:32:27,877 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:32:27,877 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:32:27,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:27 BoogieIcfgContainer [2019-01-01 21:32:27,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:32:27,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:32:27,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:32:27,883 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:32:27,884 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:27,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:32:27" (1/3) ... [2019-01-01 21:32:27,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57dc622b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:27, skipping insertion in model container [2019-01-01 21:32:27,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:27,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:32:27" (2/3) ... [2019-01-01 21:32:27,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57dc622b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:32:27, skipping insertion in model container [2019-01-01 21:32:27,888 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:32:27,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:27" (3/3) ... [2019-01-01 21:32:27,891 INFO L375 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 21:32:27,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:32:27,966 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:32:27,967 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:32:27,967 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:32:27,967 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:32:27,967 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:32:27,967 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:32:27,967 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:32:27,967 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:32:27,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:32:28,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:28,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:28,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:28,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:28,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:28,031 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:32:28,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-01 21:32:28,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:28,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:28,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:28,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:28,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:28,044 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 22#L25true call main_#t~ret6 := rec2(main_~x~0);< 3#rec2ENTRYtrue [2019-01-01 21:32:28,044 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j);< 4#rec1ENTRYtrue ~i := #in~i; 9#L12true assume ~i <= 0;#res := 0; 5#rec1FINALtrue assume true; 12#rec1EXITtrue >#33#return; 23#L20-1true call #t~ret4 := rec2(#t~ret3 - 1);< 3#rec2ENTRYtrue [2019-01-01 21:32:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-01-01 21:32:28,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:28,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:28,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2019-01-01 21:32:28,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:28,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:28,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:32:28,466 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:32:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:32:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:32:28,490 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-01-01 21:32:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:28,679 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-01 21:32:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:32:28,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-01-01 21:32:28,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:28,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 22 transitions. [2019-01-01 21:32:28,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:32:28,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:32:28,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-01 21:32:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:28,699 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:32:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-01 21:32:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 21:32:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:32:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-01 21:32:28,735 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:32:28,736 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:32:28,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:32:28,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-01 21:32:28,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:28,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:28,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:28,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:32:28,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:28,740 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 60#L25 call main_#t~ret6 := rec2(main_~x~0);< 59#rec2ENTRY [2019-01-01 21:32:28,741 INFO L796 eck$LassoCheckResult]: Loop: 59#rec2ENTRY ~j := #in~j; 62#L18 assume !(~j <= 0); 66#L20 call #t~ret3 := rec1(~j);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume !(~i <= 0); 67#L14 call #t~ret0 := rec1(~i - 2);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume ~i <= 0;#res := 0; 69#rec1FINAL assume true; 70#rec1EXIT >#27#return; 64#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume ~i <= 0;#res := 0; 69#rec1FINAL assume true; 70#rec1EXIT >#29#return; 65#L14-2 call #t~ret2 := rec1(#t~ret1);< 63#rec1ENTRY ~i := #in~i; 68#L12 assume ~i <= 0;#res := 0; 69#rec1FINAL assume true; 70#rec1EXIT >#31#return; 71#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 72#rec1FINAL assume true; 74#rec1EXIT >#33#return; 61#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 59#rec2ENTRY [2019-01-01 21:32:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 2 times [2019-01-01 21:32:28,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:28,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:28,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash -616266826, now seen corresponding path program 1 times [2019-01-01 21:32:28,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:28,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:28,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:28,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1277860358, now seen corresponding path program 1 times [2019-01-01 21:32:28,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:28,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:28,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:29,534 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-01 21:32:29,798 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-01-01 21:32:29,956 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:32:30,045 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:30,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:30,047 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:30,047 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:30,047 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:30,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:30,048 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:30,048 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:30,048 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:30,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:30,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:30,191 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:30,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:30,209 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=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 [2019-01-01 21:32:30,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:30,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,236 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:30,236 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=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 [2019-01-01 21:32:30,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:30,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:30,264 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:30,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:30,303 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:32:30,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:30,387 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:30,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:30,453 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:30,475 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:30,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:30,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:30,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:30,475 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:30,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:30,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:30,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:30,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-01 21:32:30,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:30,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:30,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:30,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:30,676 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:30,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:30,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:30,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:30,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:30,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:30,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:30,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:30,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:30,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:30,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:30,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:30,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:30,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:30,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:30,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:30,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:30,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:30,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:30,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:30,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:30,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:30,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:30,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:30,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:30,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:30,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:30,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:30,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:30,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:30,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:30,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:30,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:30,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:30,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:30,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:30,709 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:30,715 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:32:30,715 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:32:30,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:30,718 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:30,718 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:30,719 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-01-01 21:32:30,720 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:30,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:30,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 21:32:31,412 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-01-01 21:32:31,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-01-01 21:32:32,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 101 states and 147 transitions. Complement of second has 42 states. [2019-01-01 21:32:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:32:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2019-01-01 21:32:32,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. [2019-01-01 21:32:32,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 26 letters. Loop has 24 letters. [2019-01-01 21:32:32,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 48 letters. [2019-01-01 21:32:32,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:32,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 147 transitions. [2019-01-01 21:32:32,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:32,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 89 states and 135 transitions. [2019-01-01 21:32:32,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 21:32:32,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-01 21:32:32,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 135 transitions. [2019-01-01 21:32:32,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:32,608 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 135 transitions. [2019-01-01 21:32:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 135 transitions. [2019-01-01 21:32:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2019-01-01 21:32:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 21:32:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2019-01-01 21:32:32,626 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-01-01 21:32:32,626 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2019-01-01 21:32:32,626 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:32:32,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 98 transitions. [2019-01-01 21:32:32,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:32,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:32,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:32,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:32,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:32,630 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 334#L25 call main_#t~ret6 := rec2(main_~x~0);< 333#rec2ENTRY ~j := #in~j; 336#L18 assume !(~j <= 0); 366#L20 call #t~ret3 := rec1(~j);< 378#rec1ENTRY ~i := #in~i; 365#L12 assume !(~i <= 0); 345#L14 call #t~ret0 := rec1(~i - 2);< 339#rec1ENTRY [2019-01-01 21:32:32,630 INFO L796 eck$LassoCheckResult]: Loop: 339#rec1ENTRY ~i := #in~i; 347#L12 assume !(~i <= 0); 344#L14 call #t~ret0 := rec1(~i - 2);< 339#rec1ENTRY [2019-01-01 21:32:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:32,630 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2019-01-01 21:32:32,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:32,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:32,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-01-01 21:32:32,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:32,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:32,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:32,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:32,653 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2019-01-01 21:32:32,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:32,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:32,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:32,735 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:32,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:32,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:32,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:32,736 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:32,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:32,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:32,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:32,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:32,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:32,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:32,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:32,826 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:32,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:32,830 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:32,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:32,834 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#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 [2019-01-01 21:32:32,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:32,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:32,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:32,859 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:32,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:32,879 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:32,882 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:32,882 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=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 [2019-01-01 21:32:32,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:32,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:32,905 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:32,905 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2019-01-01 21:32:32,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:32,929 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:32,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:32,960 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:32,983 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:32,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:32,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:32,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:32,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:32,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:32,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:32,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:32,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:32,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-01 21:32:32,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:32,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:32,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:32,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,111 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:33,112 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:33,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:33,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:33,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:33,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,129 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:33,132 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:33,132 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:33,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:33,133 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:33,133 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:33,133 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:33,133 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:33,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:33,235 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:32:33,236 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40 Second operand 4 states. [2019-01-01 21:32:33,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40. Second operand 4 states. Result 108 states and 165 transitions. Complement of second has 13 states. [2019-01-01 21:32:33,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:32:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:32:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:32:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 21:32:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:32:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:33,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 165 transitions. [2019-01-01 21:32:33,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:33,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 96 states and 153 transitions. [2019-01-01 21:32:33,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 21:32:33,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 21:32:33,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 153 transitions. [2019-01-01 21:32:33,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:33,326 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 153 transitions. [2019-01-01 21:32:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 153 transitions. [2019-01-01 21:32:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2019-01-01 21:32:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 21:32:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2019-01-01 21:32:33,343 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2019-01-01 21:32:33,343 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2019-01-01 21:32:33,343 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:32:33,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 143 transitions. [2019-01-01 21:32:33,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:33,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:33,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:33,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:33,347 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:33,347 INFO L794 eck$LassoCheckResult]: Stem: 604#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 605#L25 call main_#t~ret6 := rec2(main_~x~0);< 609#rec2ENTRY ~j := #in~j; 629#L18 assume !(~j <= 0); 576#L20 call #t~ret3 := rec1(~j);< 575#rec1ENTRY ~i := #in~i; 577#L12 assume !(~i <= 0); 595#L14 call #t~ret0 := rec1(~i - 2);< 606#rec1ENTRY ~i := #in~i; 641#L12 assume ~i <= 0;#res := 0; 640#rec1FINAL assume true; 614#rec1EXIT >#27#return; 588#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 590#rec1ENTRY [2019-01-01 21:32:33,347 INFO L796 eck$LassoCheckResult]: Loop: 590#rec1ENTRY ~i := #in~i; 624#L12 assume !(~i <= 0); 596#L14 call #t~ret0 := rec1(~i - 2);< 590#rec1ENTRY [2019-01-01 21:32:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2019-01-01 21:32:33,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:33,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-01-01 21:32:33,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:33,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2019-01-01 21:32:33,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:33,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:33,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:32:33,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:32:33,458 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:33,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:33,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:33,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:33,459 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:33,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:33,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:33,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:32:33,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:33,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:33,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:33,542 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 [2019-01-01 21:32:33,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:33,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:33,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:33,551 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:33,595 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:33,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:33,603 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:33,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:33,627 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:33,627 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=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 [2019-01-01 21:32:33,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:33,648 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 21:32:33,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:33,672 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:33,693 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:33,695 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:33,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:33,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:33,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:33,696 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:33,696 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:33,696 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:33,696 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:33,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-01 21:32:33,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:33,696 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:33,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:33,768 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:33,768 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:33,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:33,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:33,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:33,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:33,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:33,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:33,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:33,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:33,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:33,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:33,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:33,783 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:33,783 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:33,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:33,787 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:33,787 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:33,787 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:33,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:33,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:33,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:33,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57 Second operand 5 states. [2019-01-01 21:32:33,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57. Second operand 5 states. Result 132 states and 207 transitions. Complement of second has 14 states. [2019-01-01 21:32:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-01 21:32:34,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:32:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2019-01-01 21:32:34,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 21:32:34,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:34,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 207 transitions. [2019-01-01 21:32:34,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:34,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 120 states and 195 transitions. [2019-01-01 21:32:34,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-01-01 21:32:34,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-01-01 21:32:34,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 195 transitions. [2019-01-01 21:32:34,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:34,012 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 195 transitions. [2019-01-01 21:32:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 195 transitions. [2019-01-01 21:32:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2019-01-01 21:32:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 21:32:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2019-01-01 21:32:34,026 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 185 transitions. [2019-01-01 21:32:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:32:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:32:34,027 INFO L87 Difference]: Start difference. First operand 116 states and 185 transitions. Second operand 6 states. [2019-01-01 21:32:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:34,129 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2019-01-01 21:32:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:32:34,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 195 transitions. [2019-01-01 21:32:34,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:32:34,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 127 states and 193 transitions. [2019-01-01 21:32:34,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-01-01 21:32:34,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-01-01 21:32:34,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 193 transitions. [2019-01-01 21:32:34,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:34,140 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 193 transitions. [2019-01-01 21:32:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 193 transitions. [2019-01-01 21:32:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2019-01-01 21:32:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 21:32:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2019-01-01 21:32:34,153 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2019-01-01 21:32:34,153 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2019-01-01 21:32:34,153 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:32:34,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 157 transitions. [2019-01-01 21:32:34,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:32:34,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:34,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:34,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:34,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:34,156 INFO L794 eck$LassoCheckResult]: Stem: 1181#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1182#L25 call main_#t~ret6 := rec2(main_~x~0);< 1187#rec2ENTRY ~j := #in~j; 1200#L18 assume !(~j <= 0); 1150#L20 call #t~ret3 := rec1(~j);< 1199#rec1ENTRY ~i := #in~i; 1198#L12 assume !(~i <= 0); 1146#L14 call #t~ret0 := rec1(~i - 2);< 1196#rec1ENTRY ~i := #in~i; 1195#L12 assume !(~i <= 0); 1168#L14 call #t~ret0 := rec1(~i - 2);< 1194#rec1ENTRY ~i := #in~i; 1197#L12 assume ~i <= 0;#res := 0; 1213#rec1FINAL assume true; 1212#rec1EXIT >#27#return; 1139#L14-1 [2019-01-01 21:32:34,157 INFO L796 eck$LassoCheckResult]: Loop: 1139#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1137#rec1ENTRY ~i := #in~i; 1140#L12 assume ~i <= 0;#res := 0; 1216#rec1FINAL assume true; 1207#rec1EXIT >#29#return; 1164#L14-2 call #t~ret2 := rec1(#t~ret1);< 1178#rec1ENTRY ~i := #in~i; 1210#L12 assume !(~i <= 0); 1162#L14 call #t~ret0 := rec1(~i - 2);< 1178#rec1ENTRY ~i := #in~i; 1210#L12 assume ~i <= 0;#res := 0; 1209#rec1FINAL assume true; 1208#rec1EXIT >#27#return; 1139#L14-1 [2019-01-01 21:32:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2019-01-01 21:32:34,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:34,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:34,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2019-01-01 21:32:34,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:34,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:32:34,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:34,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:34,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:34,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:32:34,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-01-01 21:32:34,510 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:32:34,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:32:34,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:32:34,511 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. cyclomatic complexity: 59 Second operand 6 states. [2019-01-01 21:32:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:34,586 INFO L93 Difference]: Finished difference Result 119 states and 173 transitions. [2019-01-01 21:32:34,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:32:34,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 173 transitions. [2019-01-01 21:32:34,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:34,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 114 states and 164 transitions. [2019-01-01 21:32:34,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-01 21:32:34,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-01-01 21:32:34,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 164 transitions. [2019-01-01 21:32:34,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:34,610 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 164 transitions. [2019-01-01 21:32:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 164 transitions. [2019-01-01 21:32:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-01 21:32:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 21:32:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2019-01-01 21:32:34,634 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-01-01 21:32:34,635 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2019-01-01 21:32:34,635 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:32:34,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. [2019-01-01 21:32:34,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 21:32:34,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:34,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:34,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:34,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:34,641 INFO L794 eck$LassoCheckResult]: Stem: 1455#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1456#L25 call main_#t~ret6 := rec2(main_~x~0);< 1463#rec2ENTRY ~j := #in~j; 1485#L18 assume !(~j <= 0); 1465#L20 call #t~ret3 := rec1(~j);< 1478#rec1ENTRY ~i := #in~i; 1475#L12 assume !(~i <= 0); 1425#L14 call #t~ret0 := rec1(~i - 2);< 1472#rec1ENTRY ~i := #in~i; 1470#L12 assume !(~i <= 0); 1423#L14 call #t~ret0 := rec1(~i - 2);< 1469#rec1ENTRY ~i := #in~i; 1471#L12 assume ~i <= 0;#res := 0; 1489#rec1FINAL assume true; 1480#rec1EXIT >#27#return; 1432#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1433#rec1ENTRY ~i := #in~i; 1492#L12 assume ~i <= 0;#res := 0; 1491#rec1FINAL assume true; 1490#rec1EXIT >#29#return; 1412#L14-2 call #t~ret2 := rec1(#t~ret1);< 1411#rec1ENTRY ~i := #in~i; 1413#L12 assume ~i <= 0;#res := 0; 1449#rec1FINAL assume true; 1451#rec1EXIT >#31#return; 1444#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 1418#rec1FINAL assume true; 1428#rec1EXIT >#27#return; 1427#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1458#rec1ENTRY [2019-01-01 21:32:34,641 INFO L796 eck$LassoCheckResult]: Loop: 1458#rec1ENTRY ~i := #in~i; 1488#L12 assume !(~i <= 0); 1419#L14 call #t~ret0 := rec1(~i - 2);< 1458#rec1ENTRY [2019-01-01 21:32:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2019-01-01 21:32:34,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:34,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2019-01-01 21:32:34,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:34,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:32:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2050992272, now seen corresponding path program 2 times [2019-01-01 21:32:34,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:34,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 21:32:34,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:34,756 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 [2019-01-01 21:32:34,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:32:34,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:32:34,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:34,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 21:32:34,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:34,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:32:34,885 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:34,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:34,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:34,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:34,886 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:34,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:34,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:34,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:34,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-01 21:32:34,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:34,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:34,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:34,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:34,954 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 [2019-01-01 21:32:34,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:34,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:34,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:34,962 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=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 [2019-01-01 21:32:34,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:34,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:34,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:34,987 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=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 [2019-01-01 21:32:35,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:35,008 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:35,027 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:35,028 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2019-01-01 21:32:35,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:35,048 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:35,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:35,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:35,092 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:35,094 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:35,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:35,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:35,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:35,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:35,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:35,095 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:35,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:35,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-01 21:32:35,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:35,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:35,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:35,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:35,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:35,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:35,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:35,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:35,218 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:35,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:35,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:35,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:35,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:35,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:35,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:35,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:35,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:35,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:35,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:35,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:35,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:35,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:35,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:35,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:35,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:35,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:35,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:35,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:35,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:35,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:35,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:35,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:35,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:35,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:35,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:35,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:35,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:35,231 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:35,231 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:35,231 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:35,231 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:35,232 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:35,232 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:35,232 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:35,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:35,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:35,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:35,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-01 21:32:35,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2019-01-01 21:32:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:32:35,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-01 21:32:35,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:35,583 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:35,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:35,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:35,826 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:35,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-01 21:32:35,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2019-01-01 21:32:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:32:35,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-01 21:32:35,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:35,957 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:36,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:36,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:36,228 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:36,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-01 21:32:36,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 156 states and 218 transitions. Complement of second has 13 states. [2019-01-01 21:32:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:32:36,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-01 21:32:36,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:36,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-01 21:32:36,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:36,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2019-01-01 21:32:36,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:36,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 218 transitions. [2019-01-01 21:32:36,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-01 21:32:36,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 138 states and 200 transitions. [2019-01-01 21:32:36,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-01-01 21:32:36,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-01-01 21:32:36,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 200 transitions. [2019-01-01 21:32:36,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:36,376 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 200 transitions. [2019-01-01 21:32:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 200 transitions. [2019-01-01 21:32:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2019-01-01 21:32:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 21:32:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2019-01-01 21:32:36,387 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2019-01-01 21:32:36,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:32:36,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:32:36,387 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand 8 states. [2019-01-01 21:32:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:36,507 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-01-01 21:32:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:32:36,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 115 transitions. [2019-01-01 21:32:36,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:32:36,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 62 states and 74 transitions. [2019-01-01 21:32:36,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:32:36,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:32:36,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 74 transitions. [2019-01-01 21:32:36,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:32:36,520 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-01-01 21:32:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 74 transitions. [2019-01-01 21:32:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-01-01 21:32:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 21:32:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-01-01 21:32:36,537 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-01-01 21:32:36,537 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-01-01 21:32:36,537 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:32:36,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. [2019-01-01 21:32:36,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:32:36,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:32:36,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:32:36,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:32:36,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:32:36,545 INFO L794 eck$LassoCheckResult]: Stem: 2631#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 2602#L25 call main_#t~ret6 := rec2(main_~x~0);< 2601#rec2ENTRY ~j := #in~j; 2603#L18 assume !(~j <= 0); 2633#L20 call #t~ret3 := rec1(~j);< 2651#rec1ENTRY ~i := #in~i; 2649#L12 assume !(~i <= 0); 2621#L14 call #t~ret0 := rec1(~i - 2);< 2647#rec1ENTRY ~i := #in~i; 2650#L12 assume ~i <= 0;#res := 0; 2648#rec1FINAL assume true; 2629#rec1EXIT >#27#return; 2630#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 2622#rec1ENTRY ~i := #in~i; 2645#L12 assume ~i <= 0;#res := 0; 2643#rec1FINAL assume true; 2639#rec1EXIT >#29#return; 2638#L14-2 call #t~ret2 := rec1(#t~ret1);< 2628#rec1ENTRY ~i := #in~i; 2641#L12 assume ~i <= 0;#res := 0; 2640#rec1FINAL assume true; 2637#rec1EXIT >#31#return; 2636#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 2635#rec1FINAL assume true; 2634#rec1EXIT >#33#return; 2605#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 2604#rec2ENTRY ~j := #in~j; 2607#L18 assume !(~j <= 0); 2611#L20 call #t~ret3 := rec1(~j);< 2608#rec1ENTRY [2019-01-01 21:32:36,545 INFO L796 eck$LassoCheckResult]: Loop: 2608#rec1ENTRY ~i := #in~i; 2610#L12 assume !(~i <= 0); 2609#L14 call #t~ret0 := rec1(~i - 2);< 2608#rec1ENTRY [2019-01-01 21:32:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1852176490, now seen corresponding path program 2 times [2019-01-01 21:32:36,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:36,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 21:32:36,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:32:36,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:32:36,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:32:36,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:32:36,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:32:36,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 21:32:36,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:32:36,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:32:36,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:32:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 4 times [2019-01-01 21:32:36,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:32:36,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:32:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:36,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:32:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:32:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:32:36,802 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:36,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:36,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:36,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:36,803 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:32:36,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:36,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:36,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:36,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-01 21:32:36,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:36,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:36,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:36,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:36,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:36,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:36,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:36,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:36,941 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:36,942 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:36,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:36,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:36,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:36,952 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:32:36,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:36,972 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:36,976 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:36,976 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:36,997 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:36,997 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:37,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:37,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:37,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:37,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:37,023 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:32:37,023 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:37,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:32:37,044 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:37,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:32:37,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:32:37,093 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:32:37,095 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:32:37,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:32:37,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:32:37,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:32:37,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:32:37,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:32:37,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:32:37,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:32:37,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-01 21:32:37,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:32:37,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:32:37,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:37,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:37,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:37,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:37,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:37,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:32:37,141 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:32:37,142 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:32:37,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:37,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:37,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:37,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:37,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:37,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:37,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:37,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:37,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:37,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:37,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:37,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:37,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:37,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:37,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:37,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:37,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:37,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:37,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:37,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:37,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:37,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:37,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:37,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:37,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:37,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:37,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:37,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:37,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:37,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:37,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:37,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:37,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:37,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:37,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:37,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:32:37,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:32:37,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:32:37,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:32:37,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:32:37,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:32:37,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:32:37,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:32:37,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:32:37,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:32:37,166 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 21:32:37,166 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:32:37,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:32:37,167 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:32:37,167 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:32:37,167 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-01-01 21:32:37,167 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:32:37,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:37,495 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 21:32:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:37,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:37,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-01 21:32:37,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2019-01-01 21:32:37,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:32:37,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-01 21:32:37,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:37,714 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:37,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:37,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-01 21:32:37,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2019-01-01 21:32:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 21:32:37,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-01 21:32:37,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:37,937 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:32:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:32:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:37,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:32:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:32:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:32:38,051 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:32:38,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-01 21:32:38,154 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 77 states and 89 transitions. Complement of second has 13 states. [2019-01-01 21:32:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:32:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:32:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-01-01 21:32:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2019-01-01 21:32:38,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:38,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-01-01 21:32:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:38,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2019-01-01 21:32:38,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:32:38,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 89 transitions. [2019-01-01 21:32:38,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:38,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-01-01 21:32:38,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:38,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:38,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:38,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:38,167 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:38,167 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 21:32:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-01 21:32:38,167 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 8 states. [2019-01-01 21:32:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:32:38,168 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:32:38,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:32:38,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:32:38,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:38,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:32:38,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:32:38,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:32:38,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:32:38,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:32:38,172 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:38,172 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:38,172 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:32:38,172 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:32:38,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:32:38,172 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:32:38,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:32:38,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:32:38 BoogieIcfgContainer [2019-01-01 21:32:38,180 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:32:38,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:32:38,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:32:38,180 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:32:38,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:32:27" (3/4) ... [2019-01-01 21:32:38,185 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:32:38,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:32:38,186 INFO L168 Benchmark]: Toolchain (without parser) took 10986.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -285.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:38,187 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:38,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:38,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.70 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:38,189 INFO L168 Benchmark]: Boogie Preprocessor took 15.02 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:38,189 INFO L168 Benchmark]: RCFGBuilder took 379.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:38,190 INFO L168 Benchmark]: BuchiAutomizer took 10301.04 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:32:38,191 INFO L168 Benchmark]: Witness Printer took 5.01 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:32:38,195 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.70 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.02 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 379.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10301.04 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.01 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 10 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 4.9s. Construction of modules took 0.9s. Büchi inclusion checks took 3.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/24 HoareTripleCheckerStatistics: 188 SDtfs, 186 SDslu, 311 SDs, 0 SdLazy, 306 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...