./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer --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 554582d6fc3de8e87f5dd30e5019302b6e1b96be .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:57:35,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:57:35,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:57:35,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:57:35,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:57:35,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:57:35,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:57:35,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:57:35,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:57:35,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:57:35,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:57:35,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:57:35,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:57:35,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:57:35,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:57:35,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:57:35,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:57:35,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:57:35,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:57:35,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:57:35,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:57:35,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:57:35,449 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:57:35,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:57:35,449 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:57:35,450 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:57:35,451 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:57:35,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:57:35,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:57:35,452 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:57:35,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:57:35,453 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:57:35,453 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:57:35,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:57:35,454 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:57:35,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:57:35,455 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:57:35,465 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:57:35,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:57:35,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:57:35,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:57:35,467 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:57:35,467 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:57:35,467 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:57:35,467 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:57:35,467 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:57:35,467 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:57:35,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:57:35,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:57:35,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:57:35,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:57:35,469 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:57:35,470 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:57:35,470 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer 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 -> 554582d6fc3de8e87f5dd30e5019302b6e1b96be [2018-11-10 02:57:35,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:57:35,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:57:35,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:57:35,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:57:35,501 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:57:35,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2018-11-10 02:57:35,538 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/data/f03b6401e/90f7c9d12df24e79828c7e705e6cd3ed/FLAGfb71705c8 [2018-11-10 02:57:35,954 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:57:35,954 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2018-11-10 02:57:35,958 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/data/f03b6401e/90f7c9d12df24e79828c7e705e6cd3ed/FLAGfb71705c8 [2018-11-10 02:57:35,968 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/data/f03b6401e/90f7c9d12df24e79828c7e705e6cd3ed [2018-11-10 02:57:35,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:57:35,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:57:35,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:57:35,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:57:35,976 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:57:35,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:57:35" (1/1) ... [2018-11-10 02:57:35,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701bc5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:35, skipping insertion in model container [2018-11-10 02:57:35,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:57:35" (1/1) ... [2018-11-10 02:57:35,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:57:36,001 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:57:36,114 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:57:36,116 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:57:36,125 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:57:36,133 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:57:36,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36 WrapperNode [2018-11-10 02:57:36,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:57:36,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:57:36,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:57:36,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:57:36,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:57:36,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:57:36,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:57:36,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:57:36,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... [2018-11-10 02:57:36,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:57:36,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:57:36,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:57:36,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:57:36,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,234 INFO L130 BoogieDeclarations]: Found specification of procedure p [2018-11-10 02:57:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure p [2018-11-10 02:57:36,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:57:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:57:36,324 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:57:36,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:57:36 BoogieIcfgContainer [2018-11-10 02:57:36,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:57:36,325 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:57:36,325 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:57:36,327 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:57:36,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:57:36,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:57:35" (1/3) ... [2018-11-10 02:57:36,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a59f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:57:36, skipping insertion in model container [2018-11-10 02:57:36,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:57:36,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:57:36" (2/3) ... [2018-11-10 02:57:36,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a59f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:57:36, skipping insertion in model container [2018-11-10 02:57:36,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:57:36,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:57:36" (3/3) ... [2018-11-10 02:57:36,330 INFO L375 chiAutomizerObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2018-11-10 02:57:36,367 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:57:36,368 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:57:36,368 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:57:36,368 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:57:36,368 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:57:36,368 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:57:36,368 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:57:36,368 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:57:36,368 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:57:36,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 02:57:36,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:36,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:36,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:36,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:57:36,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:57:36,405 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:57:36,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 02:57:36,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:36,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:36,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:36,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:57:36,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:57:36,412 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L28true assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 10#L29true call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 11#pENTRYtrue [2018-11-10 02:57:36,412 INFO L795 eck$LassoCheckResult]: Loop: 11#pENTRYtrue ~m := #in~m;~n := #in~n;~r := #in~r; 12#L13true assume ~r > 0; 9#L14true call #t~ret0 := p(~m, ~r - 1, ~n);< 11#pENTRYtrue [2018-11-10 02:57:36,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1356593, now seen corresponding path program 1 times [2018-11-10 02:57:36,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:36,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:36,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:36,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:36,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 29913, now seen corresponding path program 1 times [2018-11-10 02:57:36,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:36,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:36,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1759556521, now seen corresponding path program 1 times [2018-11-10 02:57:36,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:36,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:36,600 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:36,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:36,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:36,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:36,601 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:36,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:36,601 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:36,601 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 02:57:36,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:36,602 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:36,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,767 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:36,768 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,784 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:36,785 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,806 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:36,806 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,824 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:36,824 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,842 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:36,842 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=0} Honda state: {p_#in~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,858 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,860 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:36,860 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~n=0} Honda state: {p_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,876 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,878 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:36,878 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~m=0} Honda state: {p_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:36,895 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:36,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:36,972 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:36,973 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:36,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:36,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:36,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:36,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:36,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:36,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:36,974 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:36,974 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 02:57:36,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:36,974 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:36,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:36,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:37,037 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:37,040 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:37,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:37,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:37,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,078 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:57:37,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,080 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,083 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,084 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,087 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,088 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,091 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,093 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,094 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,098 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:37,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:37,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:37,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:37,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:37,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:37,101 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:37,101 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:37,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:37,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:37,125 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:57:37,126 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:57:37,127 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:37,128 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:37,128 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:37,128 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_#in~n + 1*p_#in~r f1 = 1*p_#in~r Supporting invariants [] [2018-11-10 02:57:37,129 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:37,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:37,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:37,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:37,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:57:37,288 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 02:57:37,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 12 states. [2018-11-10 02:57:37,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:57:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-10 02:57:37,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-10 02:57:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:37,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-10 02:57:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 02:57:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:37,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-10 02:57:37,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:37,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 21 states and 24 transitions. [2018-11-10 02:57:37,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 02:57:37,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:57:37,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 02:57:37,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:37,598 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 02:57:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 02:57:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-11-10 02:57:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 02:57:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-10 02:57:37,619 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 02:57:37,620 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 02:57:37,620 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:57:37,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-10 02:57:37,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:37,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:37,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:37,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 02:57:37,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:57:37,621 INFO L793 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 131#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 128#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 135#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 137#L13 assume !(~r > 0); 132#L16 [2018-11-10 02:57:37,621 INFO L795 eck$LassoCheckResult]: Loop: 132#L16 assume ~n > 0; 125#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 127#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 138#L13 assume !(~r > 0); 132#L16 [2018-11-10 02:57:37,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1303685879, now seen corresponding path program 1 times [2018-11-10 02:57:37,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:37,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:37,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:37,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:37,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1221437, now seen corresponding path program 1 times [2018-11-10 02:57:37,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:37,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:37,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1125326029, now seen corresponding path program 1 times [2018-11-10 02:57:37,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:37,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:37,710 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:37,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:37,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:37,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:37,711 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:37,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:37,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:37,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:37,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 02:57:37,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:37,712 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:37,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:37,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:37,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:37,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:37,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:37,781 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:37,781 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:37,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:37,784 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:37,787 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:37,787 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:37,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:37,803 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:37,809 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:37,809 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:37,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:37,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:37,827 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:37,827 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:37,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:37,843 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:37,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:37,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:38,124 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:38,126 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:38,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:38,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:38,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:38,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:38,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:38,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:38,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:38,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 02:57:38,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:38,127 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:38,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,191 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:38,191 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:38,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:38,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:38,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:38,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:38,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:38,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:38,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:38,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:38,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:38,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:38,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:38,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:38,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:38,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:38,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:38,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:38,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:38,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:38,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:38,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:38,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:38,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:38,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:38,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:38,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:38,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:38,201 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:38,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:57:38,204 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:57:38,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:38,204 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:38,204 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:38,204 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_~n) = 1*p_~n Supporting invariants [] [2018-11-10 02:57:38,205 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:38,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:38,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:38,253 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 02:57:38,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 02:57:38,264 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 31 transitions. Complement of second has 13 states. [2018-11-10 02:57:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-10 02:57:38,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 02:57:38,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:38,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-10 02:57:38,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:38,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-10 02:57:38,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:38,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-10 02:57:38,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:38,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2018-11-10 02:57:38,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 02:57:38,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 02:57:38,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-10 02:57:38,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:38,268 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 02:57:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-10 02:57:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-10 02:57:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 02:57:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-10 02:57:38,270 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 02:57:38,270 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 02:57:38,270 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:57:38,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-10 02:57:38,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:38,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:38,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:38,272 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:38,272 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:57:38,272 INFO L793 eck$LassoCheckResult]: Stem: 239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 236#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 233#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 241#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 243#L13 assume !(~r > 0); 237#L16 assume ~n > 0; 231#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 234#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 245#L13 assume ~r > 0; 229#L14 [2018-11-10 02:57:38,272 INFO L795 eck$LassoCheckResult]: Loop: 229#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 230#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 246#L13 assume ~r > 0; 229#L14 [2018-11-10 02:57:38,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1125326032, now seen corresponding path program 1 times [2018-11-10 02:57:38,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:38,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:38,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:38,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:38,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 57663, now seen corresponding path program 2 times [2018-11-10 02:57:38,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:38,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:38,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1926921136, now seen corresponding path program 1 times [2018-11-10 02:57:38,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:38,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:38,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:38,343 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:38,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:38,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:38,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:38,344 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:38,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:38,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:38,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:38,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 02:57:38,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:38,344 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:38,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:38,400 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:38,400 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:38,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:38,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:38,404 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:38,405 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=2, p_~m=2} Honda state: {p_#in~m=2, p_~m=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:38,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:38,421 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:38,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:38,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:50,464 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 02:57:50,466 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:50,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:50,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:50,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:50,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:50,467 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,467 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:50,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:50,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 02:57:50,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:50,467 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:50,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,529 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:50,530 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:50,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:50,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:50,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:50,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:50,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:50,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:50,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:50,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:50,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:50,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:50,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:50,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:50,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:50,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:50,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:50,548 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:57:50,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,548 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:50,549 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:50,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:50,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:50,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:50,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:50,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:50,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:50,551 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:50,552 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:50,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:50,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:50,568 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 02:57:50,568 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:57:50,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:50,569 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:50,569 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:50,569 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~r + 1*p_~n f1 = 1*p_~n Supporting invariants [] [2018-11-10 02:57:50,572 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:50,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:50,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:50,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:50,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:57:50,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 02:57:50,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 23 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 43 states and 51 transitions. Complement of second has 9 states. [2018-11-10 02:57:50,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:57:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 02:57:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-10 02:57:50,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-10 02:57:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:50,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 02:57:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:50,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-11-10 02:57:50,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:50,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 45 transitions. [2018-11-10 02:57:50,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 02:57:50,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:57:50,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2018-11-10 02:57:50,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:50,709 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-10 02:57:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2018-11-10 02:57:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-10 02:57:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 02:57:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-10 02:57:50,711 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-10 02:57:50,711 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-10 02:57:50,711 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:57:50,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-11-10 02:57:50,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:57:50,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:50,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:50,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:50,712 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:57:50,712 INFO L793 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 369#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 366#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 377#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 390#L13 assume !(~r > 0); 388#L16 assume ~n > 0; 365#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 367#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 382#L13 assume ~r > 0; 362#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 374#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 375#L13 assume !(~r > 0); 370#L16 [2018-11-10 02:57:50,712 INFO L795 eck$LassoCheckResult]: Loop: 370#L16 assume ~n > 0; 360#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 363#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 381#L13 assume !(~r > 0); 370#L16 [2018-11-10 02:57:50,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1926921139, now seen corresponding path program 2 times [2018-11-10 02:57:50,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:50,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:50,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:50,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1221437, now seen corresponding path program 2 times [2018-11-10 02:57:50,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:50,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1157887471, now seen corresponding path program 3 times [2018-11-10 02:57:50,728 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:50,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:50,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:50,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:50,788 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:50,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:50,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:50,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:50,788 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:50,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:50,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:50,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 02:57:50,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:50,788 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:50,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:50,837 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:50,837 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:50,840 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:50,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:50,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:51,131 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:51,132 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:51,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:51,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:51,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:51,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:51,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:51,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:51,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 02:57:51,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:51,133 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:51,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,174 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:51,175 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:51,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:51,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:51,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:51,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:51,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:51,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:51,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:51,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:51,179 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:51,180 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:57:51,180 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:57:51,180 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:51,180 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:51,180 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:51,180 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_~n) = 1*p_~n Supporting invariants [] [2018-11-10 02:57:51,181 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:51,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:51,244 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 02:57:51,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-10 02:57:51,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 45 states and 54 transitions. Complement of second has 13 states. [2018-11-10 02:57:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-10 02:57:51,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-10 02:57:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,258 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:57:51,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:51,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 02:57:51,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-10 02:57:51,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 45 states and 54 transitions. Complement of second has 13 states. [2018-11-10 02:57:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-10 02:57:51,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-10 02:57:51,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,364 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:57:51,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:51,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:51,420 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 02:57:51,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-10 02:57:51,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 56 states and 68 transitions. Complement of second has 15 states. [2018-11-10 02:57:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:57:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-10 02:57:51,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-10 02:57:51,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-10 02:57:51,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-10 02:57:51,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:51,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2018-11-10 02:57:51,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 02:57:51,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 39 states and 47 transitions. [2018-11-10 02:57:51,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:57:51,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 02:57:51,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-11-10 02:57:51,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:51,441 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-10 02:57:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-11-10 02:57:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-11-10 02:57:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 02:57:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-10 02:57:51,442 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-10 02:57:51,442 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-10 02:57:51,442 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:57:51,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-10 02:57:51,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 02:57:51,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:51,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:51,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:51,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 02:57:51,443 INFO L793 eck$LassoCheckResult]: Stem: 773#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 767#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 764#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 779#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 778#L13 assume ~r > 0; 770#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 776#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 777#L13 assume !(~r > 0); 768#L16 [2018-11-10 02:57:51,444 INFO L795 eck$LassoCheckResult]: Loop: 768#L16 assume ~n > 0; 771#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 782#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 781#L13 assume ~r > 0; 769#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 774#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 780#L13 assume !(~r > 0); 768#L16 [2018-11-10 02:57:51,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1283297937, now seen corresponding path program 1 times [2018-11-10 02:57:51,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2028029801, now seen corresponding path program 1 times [2018-11-10 02:57:51,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1308917189, now seen corresponding path program 4 times [2018-11-10 02:57:51,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:51,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:51,564 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:51,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:51,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:51,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:51,564 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:51,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:51,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:51,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 02:57:51,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:51,565 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:51,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:51,627 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:51,627 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:51,629 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:51,631 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:51,631 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:51,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:51,651 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:51,651 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:51,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:51,672 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:57:51,673 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:51,692 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:51,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:51,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:57:52,662 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:57:52,664 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:52,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:52,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:52,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:52,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:57:52,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:52,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:52,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:52,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 02:57:52,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:52,665 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:52,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:52,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:52,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:52,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:52,742 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:52,742 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:57:52,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:52,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:52,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:52,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:52,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:52,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:52,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:57:52,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:57:52,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,762 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:57:52,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:52,763 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:52,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:52,766 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:52,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,768 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:52,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:52,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:57:52,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:57:52,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:57:52,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:57:52,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:57:52,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:57:52,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:57:52,773 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:57:52,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:57:52,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:57:52,790 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 02:57:52,790 INFO L444 ModelExtractionUtils]: 7 out of 15 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 02:57:52,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:57:52,791 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:57:52,791 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:57:52,791 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~m + 1*p_~r f1 = 1*p_~m Supporting invariants [] [2018-11-10 02:57:52,791 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:57:52,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:52,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:52,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:57:52,923 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 02:57:52,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 02:57:53,105 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 92 states and 110 transitions. Complement of second has 26 states. [2018-11-10 02:57:53,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 02:57:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:57:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-11-10 02:57:53,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 02:57:53,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:53,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-10 02:57:53,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:53,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 9 letters. Loop has 14 letters. [2018-11-10 02:57:53,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:57:53,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 110 transitions. [2018-11-10 02:57:53,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 02:57:53,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 77 states and 93 transitions. [2018-11-10 02:57:53,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 02:57:53,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 02:57:53,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 93 transitions. [2018-11-10 02:57:53,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:57:53,110 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-10 02:57:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 93 transitions. [2018-11-10 02:57:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2018-11-10 02:57:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 02:57:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-10 02:57:53,114 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-11-10 02:57:53,114 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-11-10 02:57:53,114 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:57:53,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 64 transitions. [2018-11-10 02:57:53,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 02:57:53,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:57:53,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:57:53,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:57:53,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 02:57:53,116 INFO L793 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 987#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 984#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 1003#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1026#L13 assume ~r > 0; 1000#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 999#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1001#L13 assume !(~r > 0); 1006#L16 assume ~n > 0; 994#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 1015#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1007#L13 assume ~r > 0; 996#L14 [2018-11-10 02:57:53,116 INFO L795 eck$LassoCheckResult]: Loop: 996#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 997#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1004#L13 assume ~r > 0; 996#L14 [2018-11-10 02:57:53,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 681879976, now seen corresponding path program 5 times [2018-11-10 02:57:53,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash 57663, now seen corresponding path program 3 times [2018-11-10 02:57:53,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:57:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1308917192, now seen corresponding path program 6 times [2018-11-10 02:57:53,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:57:53,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:57:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:57:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:57:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:57:53,185 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:57:53,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:57:53,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:57:53,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:57:53,185 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:57:53,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:57:53,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:57:53,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 02:57:53,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:57:53,186 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:57:53,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:57:53,261 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:57:53,261 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/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 [2018-11-10 02:57:53,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:57:53,266 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:57:53,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:57:53,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:02,047 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:58:02,049 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:02,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:02,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:02,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:02,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:58:02,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:02,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:02,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 02:58:02,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:02,050 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:02,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,096 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:02,096 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:58:02,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:02,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:02,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:02,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:02,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:02,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:02,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:02,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:02,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:02,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:02,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:02,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:02,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:02,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:02,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:58:02,109 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:58:02,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,110 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:58:02,110 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:58:02,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,113 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:58:02,119 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 02:58:02,119 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:58:02,119 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:58:02,119 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:58:02,120 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:58:02,120 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~r + 1*p_~n f1 = 1*p_~n Supporting invariants [] [2018-11-10 02:58:02,120 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:58:02,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:02,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:58:02,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-10 02:58:02,258 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 83 states and 105 transitions. Complement of second has 9 states. [2018-11-10 02:58:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:58:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 02:58:02,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-10 02:58:02,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:02,262 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:02,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:02,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:58:02,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-10 02:58:02,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 83 states and 105 transitions. Complement of second has 9 states. [2018-11-10 02:58:02,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:58:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 02:58:02,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-10 02:58:02,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:02,371 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:02,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:02,424 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 02:58:02,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-11-10 02:58:02,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 88 states and 114 transitions. Complement of second has 8 states. [2018-11-10 02:58:02,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:58:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 02:58:02,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-10 02:58:02,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:02,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-10 02:58:02,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:02,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-10 02:58:02,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:02,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 114 transitions. [2018-11-10 02:58:02,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 02:58:02,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 62 states and 78 transitions. [2018-11-10 02:58:02,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 02:58:02,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 02:58:02,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2018-11-10 02:58:02,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:02,474 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-10 02:58:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2018-11-10 02:58:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-11-10 02:58:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 02:58:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2018-11-10 02:58:02,478 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-10 02:58:02,478 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-10 02:58:02,478 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:58:02,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2018-11-10 02:58:02,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 02:58:02,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:58:02,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:58:02,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 02:58:02,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 02:58:02,480 INFO L793 eck$LassoCheckResult]: Stem: 1500#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1494#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 1495#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 1490#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 1506#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1508#L13 assume !(~r > 0); 1496#L16 assume ~n > 0; 1497#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 1529#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1522#L13 assume !(~r > 0); 1498#L16 assume ~n > 0; 1499#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 1526#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1527#L13 assume ~r > 0; 1514#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 1504#pENTRY [2018-11-10 02:58:02,480 INFO L795 eck$LassoCheckResult]: Loop: 1504#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1516#L13 assume !(~r > 0); 1515#L16 assume ~n > 0; 1502#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 1512#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1510#L13 assume ~r > 0; 1501#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 1504#pENTRY [2018-11-10 02:58:02,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash 708644913, now seen corresponding path program 7 times [2018-11-10 02:58:02,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:58:02,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:02,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:58:02,514 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:58:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:58:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:02,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:58:02,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 02:58:02,547 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:58:02,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1923820573, now seen corresponding path program 2 times [2018-11-10 02:58:02,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:58:02,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:58:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:58:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:58:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:58:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:58:02,623 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:02,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:02,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:02,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:02,624 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:58:02,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:02,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:02,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 02:58:02,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:02,624 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:02,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,668 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:02,668 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:02,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:02,676 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:58:02,676 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~n=0} Honda state: {p_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/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 [2018-11-10 02:58:02,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:58:02,693 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abcf77b4-f044-4f80-81b7-2963524ed0b4/bin-2019/uautomizer/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 [2018-11-10 02:58:02,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:58:02,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:58:02,786 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:58:02,787 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:58:02,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:58:02,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:58:02,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:58:02,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:58:02,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:58:02,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:58:02,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:58:02,788 INFO L131 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 02:58:02,788 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:58:02,788 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:58:02,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:58:02,831 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:58:02,831 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:58:02,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:58:02,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:58:02,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:58:02,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:58:02,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:58:02,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:58:02,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:58:02,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:58:02,834 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:58:02,836 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:58:02,836 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:58:02,836 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:58:02,837 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:58:02,837 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:58:02,837 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_#in~m) = 1*p_#in~m Supporting invariants [] [2018-11-10 02:58:02,837 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:58:02,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:02,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 02:58:02,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 51 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-10 02:58:02,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 51 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 175 states and 224 transitions. Complement of second has 25 states. [2018-11-10 02:58:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:58:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 02:58:02,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-10 02:58:02,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:02,967 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:58:02,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:58:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:58:02,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:58:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:58:03,035 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 02:58:03,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 51 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-10 02:58:03,107 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 51 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 194 states and 254 transitions. Complement of second has 30 states. [2018-11-10 02:58:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 02:58:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:58:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-10 02:58:03,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2018-11-10 02:58:03,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:03,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 22 letters. Loop has 7 letters. [2018-11-10 02:58:03,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:03,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 15 letters. Loop has 14 letters. [2018-11-10 02:58:03,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:58:03,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 254 transitions. [2018-11-10 02:58:03,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 02:58:03,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 187 states and 243 transitions. [2018-11-10 02:58:03,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 02:58:03,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 02:58:03,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 243 transitions. [2018-11-10 02:58:03,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:58:03,113 INFO L705 BuchiCegarLoop]: Abstraction has 187 states and 243 transitions. [2018-11-10 02:58:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 243 transitions. [2018-11-10 02:58:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 105. [2018-11-10 02:58:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 02:58:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2018-11-10 02:58:03,119 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 140 transitions. [2018-11-10 02:58:03,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:58:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:58:03,122 INFO L87 Difference]: Start difference. First operand 105 states and 140 transitions. Second operand 6 states. [2018-11-10 02:58:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:58:03,173 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-11-10 02:58:03,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 02:58:03,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 126 transitions. [2018-11-10 02:58:03,175 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:58:03,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 0 states and 0 transitions. [2018-11-10 02:58:03,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:58:03,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:58:03,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:58:03,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:58:03,176 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:03,176 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:03,176 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:58:03,176 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:58:03,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:58:03,176 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:58:03,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:58:03,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:58:03 BoogieIcfgContainer [2018-11-10 02:58:03,184 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:58:03,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:58:03,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:58:03,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:58:03,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:57:36" (3/4) ... [2018-11-10 02:58:03,188 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:58:03,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:58:03,189 INFO L168 Benchmark]: Toolchain (without parser) took 27217.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -116.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:03,190 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:03,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.28 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:03,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:03,191 INFO L168 Benchmark]: Boogie Preprocessor took 9.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:03,191 INFO L168 Benchmark]: RCFGBuilder took 162.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:03,192 INFO L168 Benchmark]: BuchiAutomizer took 26858.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:58:03,192 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:58:03,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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.28 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 18.21 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 162.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26858.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 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 8 terminating modules (1 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if \old(n) + \old(r) > 0 then 1 else 0), (if \old(n) + \old(r) > 0 then \old(n) + \old(r) else \old(r)) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has 2-nested ranking function (if r + n > 0 then 1 else 0), (if r + n > 0 then r + n else n) and consists of 4 locations. One deterministic module has 2-nested ranking function (if m + r > 0 then 1 else 0), (if m + r > 0 then m + r else m) and consists of 8 locations. One deterministic module has affine ranking function \old(m) and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has 2-nested ranking function (if r + n > 0 then 1 else 0), (if r + n > 0 then r + n else n) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 24.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 157 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [4, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/4 HoareTripleCheckerStatistics: 174 SDtfs, 189 SDslu, 83 SDs, 0 SdLazy, 247 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf98 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf89 smp97 dnf100 smp100 tf106 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 22.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...