./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_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_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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 c0afa1d46bded0eb2bd485bf4790c0d11468ed7a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53:21,159 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:53:21,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:53:21,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:53:21,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:53:21,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:53:21,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:53:21,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:53:21,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:53:21,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:53:21,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:53:21,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:53:21,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:53:21,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:53:21,175 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:53:21,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:53:21,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:53:21,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:53:21,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:53:21,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:53:21,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:53:21,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:53:21,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:53:21,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:53:21,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:53:21,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:53:21,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:53:21,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:53:21,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:53:21,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:53:21,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:53:21,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:53:21,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:53:21,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:53:21,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:53:21,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:53:21,187 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:53:21,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:53:21,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:53:21,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:53:21,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:53:21,196 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:53:21,196 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:53:21,196 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:53:21,196 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:53:21,197 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:53:21,197 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:53:21,197 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:53:21,197 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:53:21,197 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:53:21,197 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:53:21,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:53:21,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:53:21,198 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:53:21,199 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:53:21,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:53:21,199 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:53:21,199 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:53:21,200 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:53:21,200 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_643e7194-d491-4f4a-babb-715adda55151/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 -> c0afa1d46bded0eb2bd485bf4790c0d11468ed7a [2018-11-10 02:53:21,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:53:21,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:53:21,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:53:21,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:53:21,237 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:53:21,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c [2018-11-10 02:53:21,281 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/data/c9fb0bc3f/f7745cfcaf224a399a3bce5131dded58/FLAG05b3627d4 [2018-11-10 02:53:21,615 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:53:21,615 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/sv-benchmarks/c/termination-crafted-lit/LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c [2018-11-10 02:53:21,620 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/data/c9fb0bc3f/f7745cfcaf224a399a3bce5131dded58/FLAG05b3627d4 [2018-11-10 02:53:21,631 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/data/c9fb0bc3f/f7745cfcaf224a399a3bce5131dded58 [2018-11-10 02:53:21,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:53:21,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:53:21,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:53:21,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:53:21,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:53:21,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49481402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21, skipping insertion in model container [2018-11-10 02:53:21,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:53:21,669 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:53:21,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:53:21,781 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:53:21,794 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:53:21,802 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:53:21,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21 WrapperNode [2018-11-10 02:53:21,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:53:21,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:53:21,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:53:21,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:53:21,811 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:53:21" (1/1) ... [2018-11-10 02:53:21,814 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:53:21" (1/1) ... [2018-11-10 02:53:21,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:53:21,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:53:21,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:53:21,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:53:21,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... [2018-11-10 02:53:21,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:53:21,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:53:21,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:53:21,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:53:21,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:21,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:53:21,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:53:22,022 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:53:22,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:53:22 BoogieIcfgContainer [2018-11-10 02:53:22,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:53:22,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:53:22,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:53:22,025 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:53:22,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:53:22,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:53:21" (1/3) ... [2018-11-10 02:53:22,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fd19a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:53:22, skipping insertion in model container [2018-11-10 02:53:22,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:53:22,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:21" (2/3) ... [2018-11-10 02:53:22,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fd19a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:53:22, skipping insertion in model container [2018-11-10 02:53:22,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:53:22,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:53:22" (3/3) ... [2018-11-10 02:53:22,029 INFO L375 chiAutomizerObserver]: Analyzing ICFG LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c [2018-11-10 02:53:22,079 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:53:22,080 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:53:22,080 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:53:22,080 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:53:22,080 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:53:22,080 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:53:22,080 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:53:22,081 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:53:22,081 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:53:22,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-10 02:53:22,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:22,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:22,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:22,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 02:53:22,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:53:22,111 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:53:22,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-10 02:53:22,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:22,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:22,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:22,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 02:53:22,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 02:53:22,121 INFO L793 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 5#L21true assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 11#L22-3true [2018-11-10 02:53:22,121 INFO L795 eck$LassoCheckResult]: Loop: 11#L22-3true assume true; 6#L22-1true assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 7#L24-3true assume !true; 14#L24-4true main_~y~0 := main_~x~0 + main_~y~0; 11#L22-3true [2018-11-10 02:53:22,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-10 02:53:22,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:22,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1206921, now seen corresponding path program 1 times [2018-11-10 02:53:22,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:22,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:22,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:22,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:22,216 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:53:22,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:53:22,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:53:22,221 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:53:22,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:53:22,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:53:22,233 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-10 02:53:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:53:22,237 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-10 02:53:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:53:22,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-10 02:53:22,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:22,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2018-11-10 02:53:22,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-10 02:53:22,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 02:53:22,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2018-11-10 02:53:22,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:53:22,244 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 02:53:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2018-11-10 02:53:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-10 02:53:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:53:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-11-10 02:53:22,262 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 02:53:22,262 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-11-10 02:53:22,262 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:53:22,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2018-11-10 02:53:22,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:22,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:22,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:22,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 02:53:22,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:53:22,264 INFO L793 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 33#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 34#L22-3 [2018-11-10 02:53:22,264 INFO L795 eck$LassoCheckResult]: Loop: 34#L22-3 assume true; 35#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 36#L24-3 assume true; 37#L24-1 assume !(main_~y~0 < main_~z~0); 39#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 34#L22-3 [2018-11-10 02:53:22,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 2 times [2018-11-10 02:53:22,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:22,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 37406706, now seen corresponding path program 1 times [2018-11-10 02:53:22,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:22,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:22,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:22,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash 119476209, now seen corresponding path program 1 times [2018-11-10 02:53:22,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:22,333 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:22,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:22,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:22,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:22,334 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:53:22,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:22,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:22,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:22,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 02:53:22,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:22,335 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:22,349 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:53:22,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:53:22,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:53:22,459 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:22,460 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:22,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:22,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:22,484 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:22,485 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:22,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:22,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:22,505 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:22,505 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:22,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:22,507 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:22,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:22,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:24,555 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:53:24,556 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:24,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:24,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:24,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:24,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:53:24,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:24,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:24,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:24,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 02:53:24,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:24,557 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:24,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:53:24,563 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:53:24,566 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:53:24,664 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:24,668 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:53:24,670 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:53:24,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:24,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:24,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:24,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:24,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:24,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:24,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:24,682 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:53:24,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:24,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:24,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:24,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:24,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:24,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:24,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:24,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:53:24,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:24,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:24,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:24,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:24,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:24,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:24,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:24,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:24,708 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:53:24,709 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:53:24,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:24,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:24,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:24,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:53:24,712 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 02:53:24,712 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 02:53:24,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:24,716 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:53:24,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:24,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:24,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:24,717 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:53:24,719 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 02:53:24,720 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 02:53:24,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:24,728 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:53:24,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:24,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:24,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:24,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:24,729 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:53:24,729 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:53:24,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:24,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:53:24,753 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 02:53:24,753 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 02:53:24,755 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:53:24,755 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:53:24,755 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:53:24,756 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 02:53:24,757 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:53:24,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:24,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:24,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:24,852 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:53:24,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:53:24,855 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 02:53:24,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 18 states and 21 transitions. Complement of second has 7 states. [2018-11-10 02:53:24,898 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:53:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:53:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-10 02:53:24,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 02:53:24,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:24,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 02:53:24,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:24,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 02:53:24,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:24,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-10 02:53:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:24,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 20 transitions. [2018-11-10 02:53:24,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 02:53:24,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-10 02:53:24,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-10 02:53:24,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:53:24,902 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 02:53:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-10 02:53:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 02:53:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 02:53:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-10 02:53:24,904 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 02:53:24,904 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 02:53:24,904 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:53:24,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-10 02:53:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:24,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:24,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:24,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:53:24,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 02:53:24,905 INFO L793 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 110#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 117#L22-3 assume true; 115#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 111#L24-3 assume true; 112#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 119#L24-3 [2018-11-10 02:53:24,905 INFO L795 eck$LassoCheckResult]: Loop: 119#L24-3 assume true; 125#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 119#L24-3 [2018-11-10 02:53:24,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1804969390, now seen corresponding path program 1 times [2018-11-10 02:53:24,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:24,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:24,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:24,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1575, now seen corresponding path program 1 times [2018-11-10 02:53:24,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:24,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:24,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:24,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:24,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash -591203180, now seen corresponding path program 2 times [2018-11-10 02:53:24,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:24,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:24,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:24,955 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:24,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:24,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:24,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:24,956 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:53:24,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:24,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:24,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:24,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 02:53:24,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:24,956 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:24,957 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:53:24,963 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:53:24,972 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:53:24,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:53:25,011 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:25,011 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:25,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:25,034 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:25,034 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:25,037 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:25,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:25,079 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:25,079 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0=-2}, {ULTIMATE.start_main_~x~0=4}, {ULTIMATE.start_main_~x~0=-1}] Lambdas: [3, 1, 1] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:25,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:25,123 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:25,123 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:25,128 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:25,159 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:25,382 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:53:25,384 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:25,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:25,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:25,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:25,384 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:53:25,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:25,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:25,384 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:25,384 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 02:53:25,384 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:25,384 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:25,385 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:53:25,388 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:53:25,390 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:53:25,400 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:53:25,430 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:25,430 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:53:25,430 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:53:25,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:25,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:25,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:25,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:25,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:25,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:25,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:25,434 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:53:25,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:25,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:25,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:25,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:25,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:25,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:25,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:25,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:25,438 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:53:25,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:25,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:25,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:25,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:25,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:25,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:25,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:25,441 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:53:25,444 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:53:25,444 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:53:25,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:53:25,445 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:53:25,445 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:53:25,445 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2018-11-10 02:53:25,445 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:53:25,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:25,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:25,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:25,481 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:53:25,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-10 02:53:25,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 02:53:25,492 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 5 states. [2018-11-10 02:53:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 02:53:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 02:53:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-10 02:53:25,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-10 02:53:25,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:25,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-10 02:53:25,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:25,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 02:53:25,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:25,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-11-10 02:53:25,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:25,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 27 transitions. [2018-11-10 02:53:25,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 02:53:25,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 02:53:25,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-10 02:53:25,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:53:25,496 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 02:53:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-10 02:53:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-10 02:53:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 02:53:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-10 02:53:25,498 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 02:53:25,498 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 02:53:25,498 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:53:25,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-10 02:53:25,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:25,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:25,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:25,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:53:25,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:53:25,499 INFO L793 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 196#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 197#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 206#L22-3 assume true; 211#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 216#L24-3 assume true; 215#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 214#L24-3 assume true; 205#L24-1 assume !(main_~y~0 < main_~z~0); 208#L24-4 [2018-11-10 02:53:25,500 INFO L795 eck$LassoCheckResult]: Loop: 208#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 209#L22-3 assume true; 198#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 199#L24-3 assume true; 202#L24-1 assume !(main_~y~0 < main_~z~0); 208#L24-4 [2018-11-10 02:53:25,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:25,500 INFO L82 PathProgramCache]: Analyzing trace with hash -591203182, now seen corresponding path program 1 times [2018-11-10 02:53:25,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:25,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:25,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:25,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash 55694406, now seen corresponding path program 2 times [2018-11-10 02:53:25,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:25,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:25,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:25,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 632689237, now seen corresponding path program 1 times [2018-11-10 02:53:25,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:25,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:25,534 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:25,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:25,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:25,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:25,535 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:53:25,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:25,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:25,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:25,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 02:53:25,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:25,535 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:25,536 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:53:25,542 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:53:25,543 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:53:25,584 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:25,584 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:25,587 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:25,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:25,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:27,834 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:53:27,836 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:27,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:27,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:27,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:27,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:53:27,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:27,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:27,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:27,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-10 02:53:27,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:27,837 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:27,838 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:53:27,844 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:53:27,845 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:53:27,871 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:27,872 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:53:27,872 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:53:27,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:27,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:27,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:27,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:27,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:27,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:27,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:27,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:27,876 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:53:27,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:27,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:27,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:27,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:27,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:27,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:27,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:27,881 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:53:27,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:27,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:27,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:27,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:27,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:27,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:27,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:27,885 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:53:27,885 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:53:27,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:27,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:27,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:27,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:27,886 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:53:27,888 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:53:27,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:27,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:53:27,898 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 02:53:27,898 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:53:27,899 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:53:27,899 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:53:27,899 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:53:27,899 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 02:53:27,900 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:53:27,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:27,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:27,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:28,013 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:53:28,014 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:53:28,014 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 02:53:28,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-11-10 02:53:28,034 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:53:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:53:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 02:53:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-10 02:53:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-10 02:53:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 10 letters. [2018-11-10 02:53:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:28,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-10 02:53:28,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:28,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 47 transitions. [2018-11-10 02:53:28,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 02:53:28,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 02:53:28,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-11-10 02:53:28,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:53:28,037 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-10 02:53:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-11-10 02:53:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-10 02:53:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 02:53:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-10 02:53:28,040 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-10 02:53:28,040 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-10 02:53:28,040 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:53:28,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-10 02:53:28,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 02:53:28,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:28,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:28,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 02:53:28,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:53:28,042 INFO L793 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 337#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 345#L22-3 assume true; 344#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 340#L24-3 assume true; 341#L24-1 assume !(main_~y~0 < main_~z~0); 348#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 353#L22-3 assume true; 366#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 338#L24-3 assume true; 339#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 367#L24-3 assume true; 355#L24-1 assume !(main_~y~0 < main_~z~0); 354#L24-4 [2018-11-10 02:53:28,042 INFO L795 eck$LassoCheckResult]: Loop: 354#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 349#L22-3 assume true; 342#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 343#L24-3 assume true; 363#L24-1 assume !(main_~y~0 < main_~z~0); 354#L24-4 [2018-11-10 02:53:28,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1313708193, now seen corresponding path program 2 times [2018-11-10 02:53:28,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:28,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash 55694406, now seen corresponding path program 3 times [2018-11-10 02:53:28,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:28,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:28,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:28,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:28,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash 248160166, now seen corresponding path program 3 times [2018-11-10 02:53:28,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:28,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:28,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:28,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:28,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:53:28,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:53:28,099 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:53:28,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:53:28,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 02:53:28,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:53:28,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:53:28,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:53:28,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 02:53:28,162 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:28,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:28,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:28,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:28,162 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:53:28,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:28,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:28,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:28,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 02:53:28,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:28,162 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:28,163 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:53:28,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:53:28,170 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:53:28,194 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:28,194 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:28,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:28,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:28,229 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:28,230 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:28,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:28,233 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:28,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:28,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:30,429 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:53:30,430 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:30,430 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:30,430 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:30,430 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:30,430 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:53:30,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:30,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:30,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:30,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-10 02:53:30,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:30,431 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:30,432 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:53:30,437 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:53:30,440 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:53:30,461 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:30,461 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:53:30,461 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:53:30,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:30,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:30,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:30,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:30,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:30,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:30,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:30,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:30,465 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:53:30,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:30,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:30,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:30,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:30,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:30,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:30,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:30,471 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:53:30,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:30,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:30,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:30,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:30,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:30,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:30,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:30,474 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:53:30,474 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:53:30,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:30,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:30,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:30,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:30,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:53:30,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:53:30,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:30,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:53:30,480 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:53:30,480 INFO L444 ModelExtractionUtils]: 3 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 02:53:30,481 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:53:30,481 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:53:30,481 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:53:30,481 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*ULTIMATE.start_main_~x~0 f1 = 1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 02:53:30,481 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:53:30,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:30,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:30,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:30,568 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:53:30,569 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:53:30,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 02:53:30,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 51 states and 61 transitions. Complement of second has 7 states. [2018-11-10 02:53:30,587 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:53:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:53:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 02:53:30,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-10 02:53:30,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:30,588 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:53:30,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:30,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:30,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:30,665 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:53:30,665 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:53:30,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 02:53:30,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 50 states and 59 transitions. Complement of second has 7 states. [2018-11-10 02:53:30,682 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:53:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:53:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-10 02:53:30,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-10 02:53:30,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:30,683 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:53:30,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:30,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:30,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:30,761 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:53:30,761 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:53:30,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-10 02:53:30,779 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 58 states and 70 transitions. Complement of second has 8 states. [2018-11-10 02:53:30,780 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:53:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 02:53:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 02:53:30,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-10 02:53:30,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:30,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-10 02:53:30,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:30,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-10 02:53:30,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:30,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 70 transitions. [2018-11-10 02:53:30,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 02:53:30,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 43 states and 52 transitions. [2018-11-10 02:53:30,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 02:53:30,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:53:30,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2018-11-10 02:53:30,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:53:30,785 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-10 02:53:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2018-11-10 02:53:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2018-11-10 02:53:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 02:53:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-10 02:53:30,787 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-10 02:53:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:53:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:53:30,788 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 8 states. [2018-11-10 02:53:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:53:30,852 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-10 02:53:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:53:30,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2018-11-10 02:53:30,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:53:30,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 49 transitions. [2018-11-10 02:53:30,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 02:53:30,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 02:53:30,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-11-10 02:53:30,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:53:30,854 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-10 02:53:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-11-10 02:53:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-10 02:53:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 02:53:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-10 02:53:30,856 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 02:53:30,856 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 02:53:30,856 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:53:30,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2018-11-10 02:53:30,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:53:30,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:30,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:30,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 02:53:30,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-10 02:53:30,859 INFO L793 eck$LassoCheckResult]: Stem: 898#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 889#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 890#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 891#L22-3 assume true; 915#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 914#L24-3 assume true; 913#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 912#L24-3 assume true; 909#L24-1 assume !(main_~y~0 < main_~z~0); 905#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 903#L22-3 assume true; 904#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 922#L24-3 assume true; 896#L24-1 [2018-11-10 02:53:30,859 INFO L795 eck$LassoCheckResult]: Loop: 896#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 916#L24-3 assume true; 917#L24-1 assume !(main_~y~0 < main_~z~0); 907#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 902#L22-3 assume true; 892#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 893#L24-3 assume true; 896#L24-1 [2018-11-10 02:53:30,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:30,859 INFO L82 PathProgramCache]: Analyzing trace with hash 574598658, now seen corresponding path program 4 times [2018-11-10 02:53:30,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:30,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:30,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:30,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1273333492, now seen corresponding path program 1 times [2018-11-10 02:53:30,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:30,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:30,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash -782485525, now seen corresponding path program 5 times [2018-11-10 02:53:30,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:30,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:53:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:30,929 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:30,930 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:30,930 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:30,930 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:30,930 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:53:30,930 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:30,930 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:30,930 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:30,930 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 02:53:30,930 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:30,930 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:30,931 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:53:30,943 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:53:30,945 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:53:30,994 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:30,994 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:31,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:31,003 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:31,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:31,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:31,271 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:53:31,272 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:31,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:31,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:31,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:31,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:53:31,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:31,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:31,273 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:31,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 02:53:31,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:31,273 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:31,273 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:53:31,275 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:53:31,282 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:53:31,313 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:31,313 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:53:31,314 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:53:31,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:31,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:31,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:31,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:31,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:31,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:31,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:31,317 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:53:31,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:31,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:31,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:31,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:31,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:31,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:31,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:31,321 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:53:31,324 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:53:31,324 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:53:31,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:53:31,325 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:53:31,325 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:53:31,325 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~z~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 02:53:31,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:53:31,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:53:31,362 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:53:31,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-10 02:53:31,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 44 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 74 states and 93 transitions. Complement of second has 8 states. [2018-11-10 02:53:31,382 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:53:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:53:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 02:53:31,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 02:53:31,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 02:53:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 02:53:31,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 93 transitions. [2018-11-10 02:53:31,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 02:53:31,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 52 states and 65 transitions. [2018-11-10 02:53:31,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 02:53:31,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-10 02:53:31,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2018-11-10 02:53:31,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:53:31,384 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2018-11-10 02:53:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2018-11-10 02:53:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-10 02:53:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 02:53:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-10 02:53:31,386 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-10 02:53:31,386 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-10 02:53:31,386 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:53:31,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2018-11-10 02:53:31,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-10 02:53:31,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:53:31,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:53:31,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 02:53:31,388 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-10 02:53:31,388 INFO L793 eck$LassoCheckResult]: Stem: 1098#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~z~0;havoc main_~x~0;havoc main_~y~0;havoc main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~z~0 := main_#t~nondet2;havoc main_#t~nondet2; 1088#L21 assume ((main_~x~0 <= 10000 && main_~x~0 >= -10000) && main_~y~0 <= 10000) && main_~z~0 <= 10000; 1097#L22-3 assume true; 1102#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 1111#L24-3 assume true; 1099#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 1100#L24-3 assume true; 1123#L24-1 assume !(main_~y~0 < main_~z~0); 1122#L24-4 main_~y~0 := main_~x~0 + main_~y~0; 1121#L22-3 assume true; 1120#L22-1 assume !!(main_~y~0 >= 1);main_~x~0 := main_~x~0 - 1; 1119#L24-3 assume true; 1090#L24-1 [2018-11-10 02:53:31,388 INFO L795 eck$LassoCheckResult]: Loop: 1090#L24-1 assume !!(main_~y~0 < main_~z~0);main_~x~0 := main_~x~0 + 1;main_~z~0 := main_~z~0 - 1; 1089#L24-3 assume true; 1090#L24-1 [2018-11-10 02:53:31,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 574598658, now seen corresponding path program 6 times [2018-11-10 02:53:31,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:31,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:31,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1755, now seen corresponding path program 2 times [2018-11-10 02:53:31,393 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:31,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:31,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:31,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:31,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:31,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1861470052, now seen corresponding path program 7 times [2018-11-10 02:53:31,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:53:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:53:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:31,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:53:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:53:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:53:31,412 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:31,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:31,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:31,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:31,413 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:53:31,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:31,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:31,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:31,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 02:53:31,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:31,413 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:31,414 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:53:31,417 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:53:31,419 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:53:31,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:53:31,456 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:31,456 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:31,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:31,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:31,487 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:31,487 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:31,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:31,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:31,510 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:53:31,510 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:31,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:53:31,513 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643e7194-d491-4f4a-babb-715adda55151/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:53:31,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:53:31,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:53:31,738 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:53:31,740 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:53:31,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:53:31,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:53:31,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:53:31,740 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:53:31,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:53:31,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:53:31,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:53:31,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 02:53:31,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:53:31,741 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:53:31,741 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:53:31,746 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:53:31,749 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:53:31,751 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:53:31,775 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:53:31,775 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:53:31,775 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:53:31,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:31,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:31,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:31,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:31,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:53:31,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:53:31,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:53:31,778 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:53:31,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:53:31,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:53:31,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:53:31,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:53:31,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:53:31,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:53:31,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:53:31,786 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:53:31,787 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:53:31,787 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:53:31,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:53:31,787 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 02:53:31,787 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:53:31,788 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2018-11-10 02:53:31,788 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 02:53:31,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,814 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:53:31,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:53:31,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-10 02:53:31,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 51 states and 62 transitions. Complement of second has 5 states. [2018-11-10 02:53:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 02:53:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 02:53:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-10 02:53:31,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-10 02:53:31,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,825 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:53:31,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,852 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:53:31,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 02:53:31,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-10 02:53:31,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 50 states and 62 transitions. Complement of second has 7 states. [2018-11-10 02:53:31,864 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:53:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 02:53:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-10 02:53:31,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-10 02:53:31,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,865 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:53:31,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:53:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:53:31,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:53:31,890 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:53:31,891 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 2 loop predicates [2018-11-10 02:53:31,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 18 Second operand 3 states. [2018-11-10 02:53:31,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 56 states and 68 transitions. Complement of second has 6 states. [2018-11-10 02:53:31,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 02:53:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 02:53:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-10 02:53:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-10 02:53:31,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-10 02:53:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-10 02:53:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:53:31,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2018-11-10 02:53:31,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:53:31,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2018-11-10 02:53:31,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:53:31,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:53:31,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:53:31,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:53:31,901 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:53:31,901 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:53:31,901 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:53:31,901 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:53:31,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:53:31,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:53:31,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:53:31,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:53:31 BoogieIcfgContainer [2018-11-10 02:53:31,907 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:53:31,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:53:31,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:53:31,907 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:53:31,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:53:22" (3/4) ... [2018-11-10 02:53:31,911 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:53:31,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:53:31,912 INFO L168 Benchmark]: Toolchain (without parser) took 10277.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.3 MB in the beginning and 880.8 MB in the end (delta: 79.5 MB). Peak memory consumption was 218.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:53:31,913 INFO L168 Benchmark]: CDTParser took 0.15 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:53:31,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.82 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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:53:31,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.75 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:53:31,914 INFO L168 Benchmark]: Boogie Preprocessor took 12.36 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 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:53:31,914 INFO L168 Benchmark]: RCFGBuilder took 184.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:53:31,915 INFO L168 Benchmark]: BuchiAutomizer took 9883.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 880.8 MB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2018-11-10 02:53:31,915 INFO L168 Benchmark]: Witness Printer took 4.23 ms. Allocated memory is still 1.2 GB. Free memory is still 880.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:53:31,918 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.82 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 21.75 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.36 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9883.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 880.8 MB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.23 ms. Allocated memory is still 1.2 GB. Free memory is still 880.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y) and consists of 4 locations. One deterministic module has affine ranking function -1 * y + z and consists of 3 locations. One deterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else y + x) and consists of 4 locations. One deterministic module has affine ranking function z + x and consists of 5 locations. One nondeterministic module has 2-nested ranking function (if x > 0 then 1 else 0), (if x > 0 then x else x + y) and consists of 4 locations. One nondeterministic module has affine ranking function -1 * y + z and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 8.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 116 SDtfs, 100 SDslu, 56 SDs, 0 SdLazy, 158 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf97 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp97 dnf100 smp100 tf108 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 7.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...